Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithmic Applications in Management

AAIM 2006: Algorithmic Aspects in Information and Management pp 138–148Cite as

Non-metric Multicommodity and Multilevel Facility Location

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4041))

Abstract

We give logarithmic approximation algorithms for the non-metric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal up to a constant factor, the latter algorithm is far away from the lower bound, but it is the first algorithm to solve the general multilevel problem. To solve the multicommodity problem, we also define a new problem, the friendly tour operator problem, which we approximate by a greedy algorithm.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aardal, K.: On the solution of one and two-level capacitated facility location problems by the cutting plane approach. Ph.D. thesis, Université Catholique de Louvain, Louvain-la-Neuve, Belgium (1992)

    Google Scholar 

  2. Aardal, K., Chudak, F.A., Shmoys, D.B.: A 3-approximation algorithm for the k-level uncapacitated facility location problem. Information Processing Letters 72(5-6), 161–167 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Aardal, K., Labbé, M., Leung, J., Queyranne, M.: On the two-level uncapacitated facility location problem. INFORMS Journal on Computing 8, 289–301 (1996)

    Article  MATH  Google Scholar 

  4. Chvátal, V.: A greedy heuristic for the set cover problem. Mathematics of Operations Research 4, 233–235 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  5. Feige, U.: A threshold of ln n for approximating set-cover. Journal of the ACM 45(4), 634–652 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Guha, S., Khuller, S.: Greedy strikes back: Improved facility location algorithms. Journal of Algorithms 31, 228–248 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Guha, S., Khuller, S.: Improved methods for approximating node weighted Steiner trees and connected dominating sets. Information and Computation 150, 57–74 (1999)

    Article  MathSciNet  Google Scholar 

  8. Hochbaum, D.S.: Heuritics for the fixed cost median problem. Mathematical Programming 22(2), 148–162 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kaufmann, L., van den Eede, M., Hansen, P.: A plant and warehouse location problem. Operational Research Quaterly 28, 547–557 (1977)

    Article  Google Scholar 

  10. Mahdian, M., Ye, Y., Zhang, J.: A 1.52-approximation algorithm for the uncapacitated facility location problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 127–137. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Mirchandani, P., Francis, R. (eds.): Discrete Location Theory. John Wiley & Sons, Inc., Chichester (1990)

    MATH  Google Scholar 

  12. Ravi, R., Sinha, A.: Multicommodity facility location. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 342–349 (2004)

    Google Scholar 

  13. Shmoys, D.B.: Approximation algorithms for facility location problems. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 27–33. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Shmoys, D.B., Swamy, C., Levi, R.: Facility location with service installation costs. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 1088–1097 (2004)

    Google Scholar 

  15. Shmoys, D.B., Tardos, E., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of the 29th ACM Symposium on the Theory of Computation (STOC 1997), pp. 265–274 (1997)

    Google Scholar 

  16. Tcha, D., Lee, B.: A branch-and-bound algorithm for the multi-level uncapacitated location problem. European Journal on Operations Research 18, 35–43 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  17. Vygen, J.: Approximation Algorithms for Facility Location Problems (Lecture Notes). Technical Report Report No. 05950-OR, Research Institute for Discrete Mathematics, University of Bonn (2005)

    Google Scholar 

  18. Zhang, J.: Approximating the two-level facility location problem via a quasi-greedy approach. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 808–817 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, Shanghai, 200433, China

    Rudolf Fleischer, Jian Li, Shijun Tian & Hong Zhu

Authors
  1. Rudolf Fleischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shijun Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hong Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Clear Water Bay, Hong Kong University of Science and Technology, Hong Kong, China

    Siu-Wing Cheng

  2. Department of Computer Science, City University of Hong Kong,  

    Chung Keung Poon

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fleischer, R., Li, J., Tian, S., Zhu, H. (2006). Non-metric Multicommodity and Multilevel Facility Location. In: Cheng, SW., Poon, C.K. (eds) Algorithmic Aspects in Information and Management. AAIM 2006. Lecture Notes in Computer Science, vol 4041. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11775096_14

Download citation

  • DOI: https://doi.org/10.1007/11775096_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35157-3

  • Online ISBN: 978-3-540-35158-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation