An optimal algorithm for the continuous/discrete weighted 2-center problem in trees

Boaz Ben-Moshe; Binay Bhattacharya; Qiaosheng Shi

doi:10.1007/11682462_19

An optimal algorithm for the continuous/discrete weighted 2-center problem in trees

Boaz Ben-Moshe, Binay Bhattacharya, Qiaosheng Shi

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

13 Scopus citations

Abstract

In this paper, an optimal algorithm to solve the continuous/discrete weighted 2-center problem is proposed. The method generalizes the "trimming" technique of Megiddo [5] in a nontrivial way, This result allows an improved O(n log n) time algorithm for the weighted 3-center and 4-center problems.

Original language	English
Title of host publication	LATIN 2006
Subtitle of host publication	Theoretical Informatics - 7th Latin American Symposium, Proceedings
Pages	166-177
Number of pages	12
DOIs	https://doi.org/10.1007/11682462_19
State	Published - 2006
Externally published	Yes
Event	LATIN 2006: Theoretical Informatics - 7th Latin American Symposium - Valdivia, Chile Duration: 20 Mar 2006 → 24 Mar 2006

Publication series

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

Conference

Conference	LATIN 2006: Theoretical Informatics - 7th Latin American Symposium
Country/Territory	Chile
City	Valdivia
Period	20/03/06 → 24/03/06

Access to Document

10.1007/11682462_19

Cite this

Ben-Moshe, B., Bhattacharya, B., & Shi, Q. (2006). An optimal algorithm for the continuous/discrete weighted 2-center problem in trees. In LATIN 2006: Theoretical Informatics - 7th Latin American Symposium, Proceedings (pp. 166-177). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3887 LNCS). https://doi.org/10.1007/11682462_19

Ben-Moshe, Boaz ; Bhattacharya, Binay ; Shi, Qiaosheng. / An optimal algorithm for the continuous/discrete weighted 2-center problem in trees. LATIN 2006: Theoretical Informatics - 7th Latin American Symposium, Proceedings. 2006. pp. 166-177 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{eeadc5a7a34446eaa0a918f10def65a9,

title = "An optimal algorithm for the continuous/discrete weighted 2-center problem in trees",

abstract = "In this paper, an optimal algorithm to solve the continuous/discrete weighted 2-center problem is proposed. The method generalizes the {"}trimming{"} technique of Megiddo [5] in a nontrivial way, This result allows an improved O(n log n) time algorithm for the weighted 3-center and 4-center problems.",

author = "Boaz Ben-Moshe and Binay Bhattacharya and Qiaosheng Shi",

year = "2006",

doi = "10.1007/11682462_19",

language = "אנגלית",

isbn = "354032755X",

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

pages = "166--177",

booktitle = "LATIN 2006",

note = "LATIN 2006: Theoretical Informatics - 7th Latin American Symposium ; Conference date: 20-03-2006 Through 24-03-2006",

}

Ben-Moshe, B, Bhattacharya, B & Shi, Q 2006, An optimal algorithm for the continuous/discrete weighted 2-center problem in trees. in LATIN 2006: Theoretical Informatics - 7th Latin American Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3887 LNCS, pp. 166-177, LATIN 2006: Theoretical Informatics - 7th Latin American Symposium, Valdivia, Chile, 20/03/06. https://doi.org/10.1007/11682462_19

An optimal algorithm for the continuous/discrete weighted 2-center problem in trees. / Ben-Moshe, Boaz; Bhattacharya, Binay; Shi, Qiaosheng.
LATIN 2006: Theoretical Informatics - 7th Latin American Symposium, Proceedings. 2006. p. 166-177 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3887 LNCS).

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

TY - GEN

T1 - An optimal algorithm for the continuous/discrete weighted 2-center problem in trees

AU - Ben-Moshe, Boaz

AU - Bhattacharya, Binay

AU - Shi, Qiaosheng

PY - 2006

Y1 - 2006

N2 - In this paper, an optimal algorithm to solve the continuous/discrete weighted 2-center problem is proposed. The method generalizes the "trimming" technique of Megiddo [5] in a nontrivial way, This result allows an improved O(n log n) time algorithm for the weighted 3-center and 4-center problems.

AB - In this paper, an optimal algorithm to solve the continuous/discrete weighted 2-center problem is proposed. The method generalizes the "trimming" technique of Megiddo [5] in a nontrivial way, This result allows an improved O(n log n) time algorithm for the weighted 3-center and 4-center problems.

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

U2 - 10.1007/11682462_19

DO - 10.1007/11682462_19

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

AN - SCOPUS:33745589493

SN - 354032755X

SN - 9783540327554

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

SP - 166

EP - 177

BT - LATIN 2006

T2 - LATIN 2006: Theoretical Informatics - 7th Latin American Symposium

Y2 - 20 March 2006 through 24 March 2006

ER -

Ben-Moshe B, Bhattacharya B, Shi Q. An optimal algorithm for the continuous/discrete weighted 2-center problem in trees. In LATIN 2006: Theoretical Informatics - 7th Latin American Symposium, Proceedings. 2006. p. 166-177. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11682462_19

An optimal algorithm for the continuous/discrete weighted 2-center problem in trees

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this