Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems

• Published in: Journal of discrete algorithms (Amsterdam, Netherlands) Netherlands), 2009-09, Vol.7 (3), p.341-362
• Main Authors: Kantor, Erez, Peleg, David
• Format: Article
• Language: English
• Subjects: Approximation algorithms; Facility location; Range assignment; Steiner trees; Wireless networks
• ISSN: 1570-8667; 1570-8675
• DOI: 10.1016/j.jda.2008.11.006

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 D 1 , D 2 , … , D h − 1 of locations that may open an intermediate transmission station and a set D h of locations of clients. Each client in D h must be serviced by an open transmission station in D h − 1 and every open transmission station in D l must be serviced by an open transmission station on the next lower level, D l − 1 . An open transmission station on the first level, D 1 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 c i j . For i ∈ F , the cost of opening a facility at location i is f i ⩾ 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 problem and the bounded hop strong-connectivity range assignment problem.