Skip to main content
SpringerLink
Log in

Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals

  • 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

Euclidean optimization problems such as TSP and minimum-length matching admit fast partitioning algorithms that compute near-optimal solutions on typical instances.

We develop a general framework for the application of smoothed analysis to partitioning algorithms for Euclidean optimization problems. Our framework can be used to analyze both the running-time and the approximation ratio of such algorithms. We apply our framework to obtain smoothed analyses of Dyer and Frieze’s partitioning algorithm for Euclidean matching, Karp’s partitioning scheme for the TSP, a heuristic for Steiner trees, and a heuristic for degree-bounded minimum-length spanning trees.

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. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)

    MATH  Google Scholar 

  2. Anthes, B., Rüschendorf, L.: On the weighted Euclidean matching problem in R d dimensions. Applicationes Mathematicae 28(2), 181–190 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arthur, D., Manthey, B., Röglin, H.: k-means has polynomial smoothed complexity. In: Proc. 50th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 405–414. IEEE, Los Alamitos (2009)

    Google Scholar 

  4. Beier, R., Vöcking, B.: Random knapsack in expected polynomial time. J. Comput. System Sci. 69(3), 306–329 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Damerow, V., Sohler, C.: Extreme points under random noise. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 264–274. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195–207 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dyer, M.E., Frieze, A.M.: A partitioning algorithm for minimum weighted euclidean matching. Inform. Process. Lett. 18(2), 59–62 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  8. Engels, C., Manthey, B.: Average-case approximation ratio of the 2-opt algorithm for the TSP. Oper. Res. Lett. 37(2), 83–84 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. In: Proc. 18th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1295–1304. SIAM, Philadelphia (2007)

    Google Scholar 

  10. Frieze, A.M., Yukich, J.E.: Probabilistic analysis of the traveling salesman problem. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, ch.7, pp. 257–308. Kluwer, Dordrecht (2002)

    Google Scholar 

  11. Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32(4), 835–859 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  12. Golin, M.J.: Limit theorems for minimum-weight triangulations, other euclidean functionals, and probabilistic recurrence relations. In: Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 252–260. SIAM, Philadelphia (1996)

    Google Scholar 

  13. Johnson, D.S., McGeoch, L.A.: Experimental analysis of heuristics for the STSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, ch.9, pp. 369–443. Kluwer, Dordrecht (2002)

    Google Scholar 

  14. Kalpakis, K., Sherman, A.T.: Probabilistic analysis of an enhanced partitioning algorithm for the Steiner tree problem in R d. Networks 24(3), 147–159 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  15. Karp, R.M.: Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Math. Oper. Res. 2(3), 209–224 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  16. León, C.A., Perron, F.: Extremal properties of sums of Bernoulli random variables. Statist. Probab. Lett. 62(4), 345–354 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  17. Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)

    Book  MATH  Google Scholar 

  18. Papadimitriou, C.H.: The Euclidean traveling salesman problem is NP-complete. Theoret. Comput. Sci. 4(3), 237–244 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  19. Papadimitriou, C.H., Vazirani, U.V.: On two geometric problems related to the traveling salesman problem. J. Algorithms 5(2), 231–246 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  20. Ravada, S., Sherman, A.T.: Experimental evaluation of a partitioning algorithm for the steiner tree problem in R 2 and R 3. Networks 24(8), 409–415 (1994)

    Article  MATH  Google Scholar 

  21. Rhee, W.T.: A matching problem and subadditive euclidean functionals. Ann. Appl. Probab. 3(3), 794–801 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  22. Röglin, H., Teng, S.-H.: Smoothed analysis of multiobjective optimization. In: Proc. 50th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 681–690. IEEE, Los Alamitos (2009)

    Google Scholar 

  23. Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3), 385–463 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  24. Spielman, D.A., Teng, S.-H.: Smoothed analysis: An attempt to explain the behavior of algorithms in practice. Comm. ACM 52(10), 76–84 (2009)

    Article  Google Scholar 

  25. Srivastav, A., Werth, S.: Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 497–507. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  26. Michael Steele, J.: Complete convergence of short paths in Karp’s algorithm for the TSP. Math. Oper. Res. 6, 374–378 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  27. Michael Steele, J.: Subadditive Euclidean functionals and nonlinear growth in geometric probability. Ann. Probab. 9(3), 365–376 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  28. Michael Steele, J.: Probability Theory and Combinatorial Optimization. CBMS-NSF Regional Conf. Series in Appl. Math., vol. 69. SIAM, Philadelphia (1987)

    Google Scholar 

  29. Supowit, K.J., Reingold, E.M.: Divide and conquer heuristics for minimum weighted euclidean matching. SIAM J. Comput. 12(1), 118–143 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  30. Varadarajan, K.R.: A divide-and-conquer algorithm for min-cost perfect matching in the plane. In: Proc. 39th Ann. Symp. on Foundations of Computer Science (FOCS), pp. 320–331. IEEE, Los Alamitos (1998)

    Google Scholar 

  31. Yukich, J.E.: Probability Theory of Classical Euclidean Optimization Problems. Lecture Notes in Mathematics, vol. 1675. Springer, Heidelberg (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Saarland University, Germany

    Markus Bläser & B. V. Raghavendra Rao

  2. Department of Applied Mathematics, University of Twente, The Netherlands

    Bodo Manthey

Authors
  1. Markus Bläser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bodo Manthey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. V. Raghavendra Rao
    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

Bläser, M., Manthey, B., Rao, B.V.R. (2011). Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. 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_10

Download citation

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

  • 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