Efficient algorithms for the weighted 2-center problem in a cactus graph

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

Volumn 3827 LNCS, Issue , 2005, Pages 693-703

  Ben Moshe, Boaz ^a   Bhattacharya, Binay ^a   Shi, Qiaosheng ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; GRAPH THEORY; PROBLEM SOLVING;

CACTUS GRAPH; VERTEX WEIGHTS; WEIGHTED 2-CENTER PROBLEMS; WEIGHTED CENTER PROBLEMS;

ALGORITHMS;

EID: 33744950132     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_70     Document Type: Conference Paper

References (8)

1. R.E. Burkard, J. Krarup, "A linear algorithm for the pos/neg-weighted 1-median problem on cactus", Comput. 60 (1998) 498-509.
2. S.L. Hakimi, "Optimum location of switching centers and the absolute centers and medians of a graph", Oper. Res. 12 (1964) 450-459.
3. O. Kariv and S.L. Hakimi, "An algorithmic approach to network location problems, Part I. The p-centers", SIAM J. Appl. Math. 37 (1979) 513-538.
4. Y.-F. Lan, Y.-L. Wang, H. Suzuki, "A linear-time algorithm for solving the center problem on weighted cactus graphs", Inform. Process. Lett. 71 (1999) 205-212.
5. 3 and related problems", SIAM J. Comput. 12:4 (1983) 759-776.
6. N. Megiddo, A. Tamir, "New results on the complexity of p-center problems", SIAM J. Comput. 12:4 (1983) 751-758.
7. A. Tamir, "Improved complexity bounds for center location problems on networks by using dynamic data structures", SIAM J. Disc. Math. 1:3 (1988) 377-396.
8. B. Zmazek, J. Žerovnik, "The obnoxious center problem on weighted cactus graphs", Disc. Appl. Math. 136 (2004) 377-386.