An O(pn2 ) algorithm for the p-median and related problems on tree graphs

Arie Tamir

doi:10.1016/0167-6377(96)00021-1

An O(pn² ) algorithm for the p-median and related problems on tree graphs

Arie Tamir^*

^*Corresponding author for this work

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

207 Scopus citations

Abstract

We improve the complexity bound of the p-median problem on trees by showing that the total running time of the "leaves to root" dynamic programming algorithm is O(pn²).

Original language	English
Pages (from-to)	59-64
Number of pages	6
Journal	Operations Research Letters
Volume	19
Issue number	2
DOIs	https://doi.org/10.1016/0167-6377(96)00021-1
State	Published - Aug 1996

Keywords

Facility location
Tree graphs
p-coverage problems
p-median problems

Access to Document

10.1016/0167-6377(96)00021-1

Cite this

@article{b22d29a727c14d1785a30ac1ef575c90,

title = "An O(pn2 ) algorithm for the p-median and related problems on tree graphs",

abstract = "We improve the complexity bound of the p-median problem on trees by showing that the total running time of the {"}leaves to root{"} dynamic programming algorithm is O(pn2).",

keywords = "Facility location, Tree graphs, p-coverage problems, p-median problems",

author = "Arie Tamir",

year = "1996",

month = aug,

doi = "10.1016/0167-6377(96)00021-1",

language = "אנגלית",

volume = "19",

pages = "59--64",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - An O(pn2 ) algorithm for the p-median and related problems on tree graphs

AU - Tamir, Arie

PY - 1996/8

Y1 - 1996/8

N2 - We improve the complexity bound of the p-median problem on trees by showing that the total running time of the "leaves to root" dynamic programming algorithm is O(pn2).

AB - We improve the complexity bound of the p-median problem on trees by showing that the total running time of the "leaves to root" dynamic programming algorithm is O(pn2).

KW - Facility location

KW - Tree graphs

KW - p-coverage problems

KW - p-median problems

UR - http://www.scopus.com/inward/record.url?scp=0030216223&partnerID=8YFLogxK

U2 - 10.1016/0167-6377(96)00021-1

DO - 10.1016/0167-6377(96)00021-1

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0030216223

SN - 0167-6377

VL - 19

SP - 59

EP - 64

JO - Operations Research Letters

JF - Operations Research Letters

IS - 2

ER -

An O(pn² ) algorithm for the p-median and related problems on tree graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this