Optimal algorithms for the path/tree-shaped facility location problems in trees

Binay Bhattacharya; Yuzhuang Hu; Qiaosheng Shi; Arie Tamir

doi:10.1007/11940128_39

Optimal algorithms for the path/tree-shaped facility location problems in trees

Binay Bhattacharya^*, Yuzhuang Hu, Qiaosheng Shi, Arie Tamir

^*Corresponding author for this work

School of Mathematical Sciences

Simon Fraser University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

In this paper we consider the problem of locating a path-shaped or tree-shaped (extensive) facility in trees under the condition that existing facilities are already located. We introduce a parametric-pruning method to solve the conditional extensive weighted 1-center location problems in trees in linear time. This improves the recent results of O(n logn) by Tamir et al. [16].

Original language	English
Title of host publication	Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings
Pages	379-388
Number of pages	10
DOIs	https://doi.org/10.1007/11940128_39
State	Published - 2006
Event	17th International Symposium on Algorithms and Computation, ISAAC 2006 - Kolkata, India Duration: 18 Dec 2006 → 20 Dec 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4288 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	17th International Symposium on Algorithms and Computation, ISAAC 2006
Country/Territory	India
City	Kolkata
Period	18/12/06 → 20/12/06

Access to Document

10.1007/11940128_39

Cite this

Bhattacharya, B., Hu, Y., Shi, Q., & Tamir, A. (2006). Optimal algorithms for the path/tree-shaped facility location problems in trees. In Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings (pp. 379-388). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4288 LNCS). https://doi.org/10.1007/11940128_39

Bhattacharya, Binay ; Hu, Yuzhuang ; Shi, Qiaosheng et al. / Optimal algorithms for the path/tree-shaped facility location problems in trees. Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. 2006. pp. 379-388 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{dc2ed5f807cb40f993c3bb6cdce196de,

title = "Optimal algorithms for the path/tree-shaped facility location problems in trees",

abstract = "In this paper we consider the problem of locating a path-shaped or tree-shaped (extensive) facility in trees under the condition that existing facilities are already located. We introduce a parametric-pruning method to solve the conditional extensive weighted 1-center location problems in trees in linear time. This improves the recent results of O(n logn) by Tamir et al. [16].",

author = "Binay Bhattacharya and Yuzhuang Hu and Qiaosheng Shi and Arie Tamir",

year = "2006",

doi = "10.1007/11940128_39",

language = "אנגלית",

isbn = "3540496947",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "379--388",

booktitle = "Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings",

note = "17th International Symposium on Algorithms and Computation, ISAAC 2006 ; Conference date: 18-12-2006 Through 20-12-2006",

}

Bhattacharya, B, Hu, Y, Shi, Q & Tamir, A 2006, Optimal algorithms for the path/tree-shaped facility location problems in trees. in Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4288 LNCS, pp. 379-388, 17th International Symposium on Algorithms and Computation, ISAAC 2006, Kolkata, India, 18/12/06. https://doi.org/10.1007/11940128_39

Optimal algorithms for the path/tree-shaped facility location problems in trees. / Bhattacharya, Binay; Hu, Yuzhuang; Shi, Qiaosheng et al.
Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. 2006. p. 379-388 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4288 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Optimal algorithms for the path/tree-shaped facility location problems in trees

AU - Bhattacharya, Binay

AU - Hu, Yuzhuang

AU - Shi, Qiaosheng

AU - Tamir, Arie

PY - 2006

Y1 - 2006

N2 - In this paper we consider the problem of locating a path-shaped or tree-shaped (extensive) facility in trees under the condition that existing facilities are already located. We introduce a parametric-pruning method to solve the conditional extensive weighted 1-center location problems in trees in linear time. This improves the recent results of O(n logn) by Tamir et al. [16].

AB - In this paper we consider the problem of locating a path-shaped or tree-shaped (extensive) facility in trees under the condition that existing facilities are already located. We introduce a parametric-pruning method to solve the conditional extensive weighted 1-center location problems in trees in linear time. This improves the recent results of O(n logn) by Tamir et al. [16].

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

U2 - 10.1007/11940128_39

DO - 10.1007/11940128_39

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77249144892

SN - 3540496947

SN - 9783540496946

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 379

EP - 388

BT - Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings

T2 - 17th International Symposium on Algorithms and Computation, ISAAC 2006

Y2 - 18 December 2006 through 20 December 2006

ER -

Bhattacharya B, Hu Y, Shi Q, Tamir A. Optimal algorithms for the path/tree-shaped facility location problems in trees. In Algorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings. 2006. p. 379-388. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11940128_39

Optimal algorithms for the path/tree-shaped facility location problems in trees

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this