Exploiting structure: Location problems on trees and treelike graphs

International Series in Operations Research and Management Science

Volumn 155, Issue , 2011, Pages 315-334

  Kincaid, Rex K ^a  

^a Dept of Economics and Thomas Jefferson Program in Public Policy at the College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84882967572     PISSN: 08848289     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-1-4419-7572-0_14     Document Type: Chapter

References (39)

1. Ben-Moshe B, Bhattacharya B, Shi Q, Tamir A (2007) Efficient algorithms for center problems in cactus networks. Theor Comp Sci 378:237-252
2. Bodlaender HL (1996) A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J Comp 25(6):1305-1317
3. Burkard RE, Krarup J (1998) A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60:193-215
4. Cabello S, Rote G (2007) Obnoxious centers in graphs. Proceedings of the eighteenth annual ACM-SIAM Symposium on Discrete Algorithms New Orleans, Louisiana, pp 98-107
5. Cayley A (1889) A theorem on trees. Quart J Math 23;376-378
6. Chen ML, Francis RL, Lawrence JF, Lowe TJ, Tufecki S (1985) Block-vertex duality and the onemedian problem. Networks 15;395-412
7. Courant R, Robbins H (1941) What is mathematics? Oxford University Press, Oxford
8. Drezner Z, Hamacher HW (eds) (2001) Facility location: applications and theory. Springer, Berlin
9. Essam JW, Fisher ME (1970) Some basic definitions in graph theory. Rev Mod Phys 42:272-288
10. Frederickson G, Johnson D (1983) Finding k-paths and p-centers by generating and searching good data structures. J Algorithms 4:61-80
11. Goldman AJ (1969) Optimum locations for centers in a network. Transp Sci 3:352-360
12. Goldman AJ (1971) Optimal center locations in simple networks. Transp Sci 5:212-221
13. Goldman AJ (1972) Minimax facility location of a facility in a network. Transp Sci 6:407-418
14. Goldman AJ, Witzgall CJ (1970) A localization theorem for optimal facility placement. Transp Sci 4:406-409
15. Gurevich Y, Stockmeyer L, Vishkin U (1982) Solving NP-hard problems on graphs that are almost trees and an application to facility location problems. Research Report RC 9348, IBM Watson Research Center, New York
16. Gurevich Y, Stockmeyer L, Vishkin U (1984) Solving NP-hard problems on graphs that are almost trees and an application to facility location problems. J ACM 31(3):459-473
17. Hakimi SL (1964) Optimal locations of switching centers and the absolute centers and medians of a graph. Oper Res 12;450-459
18. Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13;462-475
19. Hakimi SL (1983) On locating new facilities in a competitive environment. Eur J Oper Res 12;29- 35
20. Harary F (1969) Graph theory. Addison-Wesley, Reading
21. Harary F, Norman RZ (1953) The dissimilarity characteristic of Husimi trees. Ann Math (Second Series) 58(1):131-141
22. Hatzl J (2007) Median problems on wheels and cactus graphs. Computing 80:377-393
23. Hooker JN, Chen CK, Garfinkel RS (1991) Finite dominating sets for network location problems. Oper Res 39:100-118
24. Hua Lo-Keng et al. (1961) Application of mathematical methods to wheat harvesting. Acta Math Sinica 11:77-91 (in Chinese). An English translation appeared in 1962 in Chinese Mathematics 2:77-91
25. Jordan C (1869) Sur les assemblages de lignes. J rein angew Math 70:185-190
26. Kariv O, Hakimi SL (1979a) An algorithmic approach to network location problems. Part I: The p-centers. SIAM J Appl Math 37:513-538
27. Kariv O, Hakimi SL (1979b) An algorithmic approach to network location problems. Part II: The p-medians. SIAM J Appl Math 37:539-560
28. Kennelly AE (1899) Equivalence of triangles and stars in conducting networks. Electr World Eng 34:413-414
29. Kincaid RK, Maimon O (1989) Locating a point of minimum variance on triangular graphs. Transp Sci 23;216-219
30. Kincaid RK, Lowe TJ (1990) Locating an absolute center on graphs that are almost trees. Eur J Oper Res 44:357-372
31. Kirchhoff G (1847) Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird. Ann Phys Chem 72:497-508
32. Levy J (1967) An extended theorem for location on a network. Oper Res Quart 18;433-442
33. Lan Y, Wang Y (2000) An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs. Eur J Oper Res 122;602-610
34. Tansel BC, Francis RL, Lowe TJ (1983) Location on networks: a survey. Part II: Exploiting tree network structure. Manag Sci 29;498-511
35. Tarjan R (1972) Depth first search and linear graph algorithms. SIAM J Comp 1:146-160
36. Weber A (1909) Über den Standort der Industrien, Tübingen, (1909). (English translation by Friedrich, C.G. (1929) Theory of Location of Industries, University of Chicago Press.)
37. West DB (2001) Introduction to graph theory, 2nd edn. Prentice Hall, Upper Saddle River
38. Zelinka B (1968) Medians and peripherians of trees. Arch Math (Brno) 4:87-95
39. Zmazek B, Zerovnik J (2004) The obnoxious center problem on weighted cactus graphs. Discrete Appl Math 136;377-386