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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publicationAlgorithms and Computation - 17th International Symposium, ISAAC 2006, Proceedings
Pages379-388
Number of pages10
DOIs
StatePublished - 2006
Event17th International Symposium on Algorithms and Computation, ISAAC 2006 - Kolkata, India
Duration: 18 Dec 200620 Dec 2006

Publication series

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

Conference

Conference17th International Symposium on Algorithms and Computation, ISAAC 2006
Country/TerritoryIndia
CityKolkata
Period18/12/0620/12/06

Fingerprint

Dive into the research topics of 'Optimal algorithms for the path/tree-shaped facility location problems in trees'. Together they form a unique fingerprint.

Cite this