Advertisement

Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems

  • Erez Kantor
  • David Peleg
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3998)

Abstract

The paper concerns a new variant of the hierarchical facility location problem on metric powers (\({{\rm \sc HFL}_\beta[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 ij . For iF, 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 and the bounded hop strong-connectivity range assignment problems.

Keywords

Approximation Algorithm Facility Location Steiner Tree Transmission Station Facility Location Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Althaus, E., Funke, S., Har-Peled, S., Koenemann, J., Ramos, E.A., Skutella, M.: Approximation k-hop minimum-spanning trees. Operations Research Letters 33, 115–120 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bar-ilan, J., Kortsarz, G., Peleg, D.: Generalized aubmodular cover problems and applications. In: Proc. 4th Israel Symp. on Theory of Computing and Systems, pp. 110–118 (1996)Google Scholar
  3. 3.
    Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. In: Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pp. 192–200 (1998)Google Scholar
  4. 4.
    Chudak, F.A.: Improved approximation algorithm for uncapacitated facility location problem. In: Proc. 6th Conf. on Integer Programing and Combinatorial Optimization, pp. 180–194 (1998)Google Scholar
  5. 5.
    Clementi, A.E.F., Penna, P., Ferreira, A., Perennes, S., Silvestri, R.: The minimum range assignment problem on linear radio networks. Algorithmica 35(2), 95–110 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Clementi, A.E.F., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mobile Network Applic. 9(2), 125–140 (2004)CrossRefGoogle Scholar
  7. 7.
    Feige, U.: A threshold of ln n for approximating set cover. In: Proc. 28th ACM Symp. on Theory of Computing, pp. 314–318 (1996)Google Scholar
  8. 8.
    Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  9. 9.
    Aardal, K., Chudak, A.F., Shmoys, B.D.: A 3-approximation algorithm for the K-level uncapacitated facility location problem. Information Processing Letters 72, 161–167 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Kirousis, L.M., Kranakis, E., Kriznac, D., Pelc, A.: Power consumption in packet radio networks. In: Proc. 14th Symp. on Theoretical Aspects of Computer Science, pp. 363–374 (1997)Google Scholar
  11. 11.
    Kortsarz, G., Peleg, D.: Approximating the weight of shallow steiner trees. Discrete Applied Math., 265–285 (1999)Google Scholar
  12. 12.
    Lin, J.H., Vitter, J.S.: ε−approximations with small packing constraint violation. In: Proc. 24th ACM Symp. on Theory of Computing, pp. 771–782 (1992)Google Scholar
  13. 13.
    Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. J. ACM 41, 960–981 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Mahdian, M., Ye, Y., Zhang, J.: A 1.52-approximation algorithm for the uncapacitated facility location problem. In: Proc. 5th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 229–242 (2002)Google Scholar
  15. 15.
    Shmoys, B.D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proc. 29th ACM Symp. on Theory of Computing, pp. 265–274 (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Erez Kantor
    • 1
  • David Peleg
    • 1
  1. 1.Department of Computer Science and Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations