TY - GEN

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

AU - Kantor, Erez

AU - Peleg, David

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746031803&partnerID=8YFLogxK

U2 - 10.1007/11758471_22

DO - 10.1007/11758471_22

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:33746031803

SN - 354034375X

SN - 9783540343752

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

SP - 211

EP - 222

BT - Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings

PB - Springer Verlag

T2 - 6th Italian Conference on Algorithms and Complexity, CIAC 2006

Y2 - 29 May 2006 through 31 May 2006

ER -