Skip to main content
SpringerLink
Log in

New Algorithms for 1-D Facility Location and Path Equipartition Problems

  • Conference paper
Algorithms and Data Structures (WADS 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6844))

Included in the following conference series:

Abstract

We study the one-dimensional facility location problems. Given a set of n customers on the real line, each customer having a cost for setting up a facility at its position, and an integer k, we seek to find at most k of the customers to set up facilities for serving all n customers such that the total cost for facility set-up and service transportation is minimized. We consider several problem variations including k-median and k-coverage and a linear model. We also study a related path equipartition problem: Given a vertex-weighted path and an integer k, remove k − 1 edges so that the weights of the resulting k sub-paths are as equal as possible. Based on new problem modeling and observations, we present improved algorithms for these problems over the previous work.

This research was supported in part by NSF under Grant CCF-0916606.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. ACM Computing Surveys 30(4), 412–458 (1998)

    Article  Google Scholar 

  2. Aggarwal, A., Klawe, M., Moran, S., Shor, P., Wilbur, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2, 195–208 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  3. Aggarwal, A., Schieber, B., Tokuyama, T.: Finding a minimum weight k-link path in graphs with concave Monge property and applications. Discrete & Computational Geometry 12, 263–280 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Auletta, V., Parente, D., Persiano, G.: Placing resources on a growing line. Journal of Algorithms 26(1), 87–100 (1998)

    MathSciNet  MATH  Google Scholar 

  5. Chandrasekaran, R., Tamir, A.: Algebraic optimization: The Fermat-Weber location problem. Mathematical Programming 46(2), 219–224 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  6. Drezner, Z., Hamacher, H.W.: Facility Location: Applications and Theory. Springer, New York (2004)

    MATH  Google Scholar 

  7. Dyer, M.E.: On a multidimensional search technique and its application to the Euclidean one centre problem. SIAM Journal on Computing 15(3), 725–738 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  8. Frederickson, G.N.: Optimal algorithms for tree partitioning. In: Proc. of the 2nd Annual ACM-SIAM Symposium of Discrete Algorithms, pp. 168–177 (1991)

    Google Scholar 

  9. Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for geometry problems. In: Proc. of the 16th Annual ACM Symposium on Theory of Computing (STOC), pp. 135–143 (1984)

    Google Scholar 

  10. Galil, Z., Park, K.: A linear-time algorithm for concave one-dimensional dynamic programming. Information Processing Letters 33(6), 309–311 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hassin, R., Tamir, A.: Improved complexity bounds for location problems on the real line. Operations Research Letters 10, 395–402 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  12. Ho, P.-H., Tamir, A., Wu, B.Y.: Minimum L k path partitioning – An illustration of the Monge property. Operations Research Letters 36(1), 43–45 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Klawe, M.M.: A simple linear time algorithm for concave one-dimensional dynamic programming. Technical Report 89-16. University of British Columbia, Vancouver, Canada (1989)

    Google Scholar 

  14. Larmore, L., Schieber, B.: On-line dynamic programming with applications to the prediction of RNA secondary structure. Journal of Algorithms 12(3), 490–515 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  15. Lee, D.T., Wu, Y.F.: Geometric complexity of some location problems. Algorithmica 1(1-4), 193–211 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  16. Liverani, M., Morgana, A., Simeone, B., Storchi, G.: Path equipartition in the Chebyshev norm. European Journal of Operational Research 123(2), 428–435 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Love, R.F.: One-dimensional facility location-allocation using dynamic programming. Management Science 22(5), 614–617 (1976)

    Article  MATH  Google Scholar 

  18. Manne, F., Sørevik, T.: Optimal partitioning of sequences. Journal of Algorithms 19(2), 235–249 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  19. Megiddo, N.: Linear-time algorithms for linear programming in R 3 and related problems. SIAM Journal on Computing 12(4), 759–776 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  20. Megiddo, N., Zemel, E., Hakimi, S.L.: The maximum coverage location problem. SIAM J. on Algebraic and Discrete Methods 4(2), 253–261 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  21. Olstad, B., Manne, F.: Efficient partitioning of sequences. IEEE Transactions on Computers 44(1995), 1322–1326 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  22. Schieber, B.: Computing a minimum weight k-link path in graphs with the concave Monge property. Journal of Algorithms 29(2), 204–222 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  23. van Hoesel, S., Wagelmans, A.: On the p-coverage problem on the real line. Statistica Neerlandica 61(1), 16–34 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  24. Woeginger, G.J.: Monge strikes again: optimal placement of web proxies in the Internet. Operations Research Letters 27(3), 93–96 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, 46556, USA

    Danny Z. Chen & Haitao Wang

Authors
  1. Danny Z. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haitao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Parallel Computing and Bioinformatics Laboratory, Carleton University, VISM Building, Room 6210, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Frank Dehne

  2. Department of Computer Science and Engineering, Polytechnic Institute of New York University, 5 MetroTech Center, 11201, New York, NY, USA

    John Iacono

  3. School of Computer Science, Herzberg Laboratories, Carleton University, Herzberg Building, Room 5350, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Jörg-Rüdiger Sack

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D.Z., Wang, H. (2011). New Algorithms for 1-D Facility Location and Path Equipartition Problems. In: Dehne, F., Iacono, J., Sack, JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22300-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22300-6_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22299-3

  • Online ISBN: 978-3-642-22300-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation