Securely Connected Facility Location in Metric Graphs

Maren Martens () and Andreas Bley ()
Additional contact information
Maren Martens: Axxom Software AG
Andreas Bley: TU Berlin

A chapter in Operations Research Proceedings 2010, 2011, pp 289-294 from Springer

Abstract: Abstract Connected facility location problems arise in many different applications areas, such as transportation, logistics, or telecommunications. Given a set of clients and potential facilities, one has to construct a connected facility network and attach the remaining clients to the chosen facilities via access links. Here, we consider interconnected facility location problems, where we request 1- or 2-connectivity in the subnetwork induced by the chosen facilities alone, disregarding client nodes. This type of connectivity is required in telecommunication networks, for example, where facilities represent core nodes that communicate directly with each other. We show that the interconnected facility location problem is strongly NP-hard for both 1-and 2-connectivity among the facilities, even for metric edge costs. We present simple randomized approximation algorithms with expected approximation ratios 4.40 for 1-connectivity and 4.42 for 2-connectivity. For the classical 2-connected facility location problem, which allows to use non-facility nodes to connect facilities, we obtain an algorithm with expected approximation guarantee of 4.26.

Keywords: Facility Location; HAMILTONIAN Cycle; Core Network; Facility Location Problem; Open Facility (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

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:oprchp:978-3-642-20009-0_46

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

DOI: 10.1007/978-3-642-20009-0_46

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().