e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximating the weight of shallow Steiner trees
Discrete Applied Mathematics
A 3-approximation algorithm for the k-level uncapacitated facility location problem
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Power Consumption in Packet Radio Networks (Extended Abstract)
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Improved Approximation Algorithms for Metric Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Approximating the two-level facility location problem via a quasi-greedy approach
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating k-hop minimum-spanning trees
Operations Research Letters
Minimizing Energies with Hierarchical Costs
International Journal of Computer Vision
Computers and Industrial Engineering
| Hi-index | 0.00 |
The paper concerns a new variant of the hierarchical facility location problem on metric powers (HFL"@b[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.