Approximate hierarchical facility location and applications to the shallow steiner tree and range assignment problems

Erez Kantor, David Peleg

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

9 Scopus citations

Abstract

The paper concerns a new variant of the hierarchical facility location problem on metric powers (HFLβ[h]), which is a multi-level uncapacitated facility location problem defined as follows. The input consists of a set F of locations that may open a facility, subsets D1, D 2, ..., Dh-1 of locations that may open an intermediate transmission station and a set Dh of locations of clients. Each client in Dh, must be serviced by an open transmission station in Dh-1 and every open transmission station in Di must be serviced by an open transmission station on the next lower level, Dl-1. An open transmission station on the first level, D1 must be serviced by an open facility. The cost of assigning a station j on level l ≥ 1 to a station i on level l - 1 is cij. For i ∈ F, the cost of opening a facility at location i is fi ≥ 0. It is required to find a feasible assignment that minimizes the total cost. A constant ratio approximation algorithm is established for this problem. This algorithm is then used to develop constant ratio approximation algorithms for the bounded depth steiner tree and the bounded hop strong-connectivity range assignment problems.

Original languageEnglish
Title of host publicationAlgorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings
PublisherSpringer Verlag
Pages211-222
Number of pages12
ISBN (Print)354034375X, 9783540343752
DOIs
StatePublished - 2006
Externally publishedYes
Event6th Italian Conference on Algorithms and Complexity, CIAC 2006 - Rome, Italy
Duration: 29 May 200631 May 2006

Publication series

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

Conference

Conference6th Italian Conference on Algorithms and Complexity, CIAC 2006
Country/TerritoryItaly
CityRome
Period29/05/0631/05/06

Fingerprint

Dive into the research topics of 'Approximate hierarchical facility location and applications to the shallow steiner tree and range assignment problems'. Together they form a unique fingerprint.

Cite this