Exploiting Structure: Location Problems on Trees and Treelike Graphs

Rex K. Kincaid ()
Additional contact information
Rex K. Kincaid: The College of William and Mary

Chapter Chapter 14 in Foundations of Location Analysis, 2011, pp 315-334 from Springer

Abstract: Abstract Posing location problems on graphs or networks has sharpened our understanding of what underlying structures can be exploited to prove theorems and to develop efficient algorithms. The construction of efficient algorithms for network location problems has been greatly aided by the work of computer scientists who have devised algorithms and data structures that allow efficient traversal and storage of graphs. In this chapter the contributions of three early location analysis papers are examined in detail. Key ideas are identified and their effects traced forward through the literature. In addition, natural extensions of these key ideas are included. However, no attempt is made to be encyclopedic when surveying the literature. The chapter concludes with comments on future research directions.

Keywords: Location Problem; Linear Time Algorithm; Outerplanar Graph; Vertex Weight; Edge Deletion (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-7572-0_14

Ordering information: This item can be ordered from
http://www.springer.com/9781441975720

DOI: 10.1007/978-1-4419-7572-0_14

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().