Skip to main content
SpringerLink
Log in

Performance Guarantees

  • Chapter
Theoretical Aspects of Local Search

  • 1227 Accesses

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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.

5.5 Bibliographical Notes

  • Alimonti, P. [1995], Non-oblivious local search for graphs and hypergraph coloring problems, Proceedings of the 21st Workshop on Graph-Theoretic Concepts in Computer Science, Aachen, Germany, 167–180.

    Google Scholar 

  • Alimonti, P. [1997], Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT, Proceedings of the 23rd Workshop on Graph-Theoretic Concepts in Computer Science, Berlin, Germany, 2–14.

    Google Scholar 

  • Angel, E., and V. Zissimopoulos [1998], On the quality of local search for the quadratic assignment problem, Discrete Applied Mathematics 82, 15–25.

    Article  MathSciNet  MATH  Google Scholar 

  • Arkin, E.M., and R. Hassin [1998], On local search for weighted k-set packing, Mathematics of Operations Research 23, 640–648.

    MathSciNet  MATH  Google Scholar 

  • Armstrong, D.E., and S.H. Jacobson [2003], Studying the complexity of global verification for NP-hard discrete optimization problems, Journal of Global Optimization 27, 83–96.

    Article  MathSciNet  MATH  Google Scholar 

  • Arya, V., N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit [2004], Local search heuristic for k-median and facility location problems, SIAM Journal on Computing 33, 544–562.

    Article  MathSciNet  MATH  Google Scholar 

  • Bafna, V., B. Narayanan, and R. Ravi [1996], Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles), Discrete Applied Mathematics 71, 41–53.

    Article  MathSciNet  MATH  Google Scholar 

  • Berman, P. [2000], A d/2 approximation for maximum weight independent set in d-claw free graphs, Nordic Journal of Computing 7, 178–184.

    MathSciNet  MATH  Google Scholar 

  • Boykov, Y., O. Veksler, and R. Zabih [2001], Fast approximate energy minimization via graph cuts, IEEE Transactions on Pattern Analysis and Machine Intelligence 23, 1222–1239.

    Article  Google Scholar 

  • Boykov, Y., O. Veksler, and R. Zabih [1998], Markov random fields with efficient approximations, Proceedings of the 1998 IEEE Conference on Computer Vision and Pattern Recognition, Santa Barbara, CA, 648–655.

    Google Scholar 

  • Brüggemann, T., J. Monnot, and G.J. Woeginger [2003], Local search for the minimum label spanning tree problem with bounded color classes, Operations Research Letters 31, 195–201.

    Article  MathSciNet  MATH  Google Scholar 

  • Bylka, S., A. Idzik, and Z. Tuza [1999], Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdös inequality, Discrete Mathematics 194, 39–58.

    Article  MathSciNet  MATH  Google Scholar 

  • Chandra, B., and M.M. Halldórsson [2001], Greedy local improvement and weighted packing approximation, Journal of Algorithms 39, 223–240.

    Article  MathSciNet  MATH  Google Scholar 

  • Chandra, B., H. Karloff, and C. Tovey [1999], New results on the old k-opt algorithm for the traveling salesman problem, SIAM Journal on Computing 28, 1998–2029.

    Article  MathSciNet  MATH  Google Scholar 

  • Charikar, M., and S. Guha [1999], Improved combinatorial algorithms for the facility location and k-median problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York City, NY, 378–388.

    Google Scholar 

  • Cho, Y., and S. Sahni [1980], Bounds for list schedules on uniform processors, SIAM Journal on Computing 9, 91–103.

    Article  MathSciNet  MATH  Google Scholar 

  • Deineko, V.G., M. Hoffmann, Y. Okamoto, and G.J. Woeginger [2004], The traveling salesman problem with few inner points, Proceedings of the 10th International Computing and Combinatorics Conference, Jeju Island, Korea, 268–277.

    Google Scholar 

  • Feigle, U., M. Karpinski, and M. Langberg [2002], Improved approximation of MAX-CUT on graphs of bounded degree, Journal of Algorithms 43, 201–219.

    Article  MathSciNet  Google Scholar 

  • Finn, G., and E. Horowitz [1979], A linear-time approximation algorithm for multiprocessor scheduling, BIT 19, 312–320.

    Article  MathSciNet  MATH  Google Scholar 

  • Dantsin, E., A. Goerdt, E.A. Hirsch, R. Kannan, J. Kleinberg, C.H. Papadimitriou, P. Raghavan, and U. Schöning [2002], A deterministic \( \left( {2 - \frac{2} {{k + 1}}} \right)^n \) algorithm for k-SAT based on local search, Theoretical Computer Science, 69–83.

    Google Scholar 

  • Dantsin, E., A. Goerdt, E.A. Hirsch, R. Kannan, J. Kleinberg, C.H. Papadimitriou, P. Raghavan, and U. Schöning [2002], A deterministic \( \left( {2 - \frac{2} {{k + 1}}} \right)^n \) algorithm for k-SAT based on local search, Theoretical Computer Science, 69–83.

    Google Scholar 

  • Gupta, A., and E. Tardos [2000], A constant factor approximation algorithm for a class of classification problems, Proceedings of the 32nd ACM Symposium on Theory of Computing, Portland, OR, 652–658.

    Google Scholar 

  • Halldórsson, M.M., and H.C Lau [1997], Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and 3-coloring, Journal of Graph Algorithms and Applications 1, 1–13.

    MathSciNet  Google Scholar 

  • Halldórsson, M.M. [1995], A still better performance guarantee for approximate graph coloring, Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 160–169.

    Google Scholar 

  • Hansen, P., and B. Jaumard [1990], Algorithms for the maximum satisfiability problem, Computing 44, 279–303.

    Article  MathSciNet  MATH  Google Scholar 

  • Hassin, R., A. Levin, and D. Morad [2003], Lexicographic local search and the p-center problem, European Journal of Operational Research 151, 265–279.

    Article  MathSciNet  MATH  Google Scholar 

  • Hirsch, E.A. [2003], Worst-case study of local search for MAX-k-SAT, Discrete Applied Mathematics 130, 173–184.

    Article  MathSciNet  MATH  Google Scholar 

  • Hurkens, C.A.J., and A. Schrijver [1989], On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM Journal on Discrete Mathematics 2, 68–72.

    Article  MathSciNet  MATH  Google Scholar 

  • Kanungo, T., D.M. Mount, N.S. Netanyahu, C.D. Piatko, R. Silverman, and A.Y. Wu [2002], A local search approximation algorithm for k-means clustering, Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, 10–18.

    Google Scholar 

  • Khanna, S., R. Motwani, M. Sudan, and U. Vazirani [1998], On syntactic versus computational views of approximability, SIAM Journal on Computing 28, 164–191.

    Article  MathSciNet  MATH  Google Scholar 

  • Knuth, D.E. [1998], The Art of Computer Programming; Volume 3, Sorting and Searching, Addison-Wesley.

    Google Scholar 

  • Korupolu, M., C.G. Plaxton, and R. Rajaraman [2000], Analysis of a local search heuristic for facility location problems, Journal of Algorithms 37, 146–188.

    Article  MathSciNet  MATH  Google Scholar 

  • Langston, M.A. [1982], Improved 0/1-interchange scheduling, BIT 22, 282–290.

    Article  MATH  Google Scholar 

  • Lu, H., and R. Ravi [1992], The power of local optimization: approximation algorithms for maximum leaf spanning tree, Proceedings of the 30th Annual Allerton Conference on Communication, Control, and Computing, Urbana, IL, 533–542.

    Google Scholar 

  • Orlin, J.B., A.P. Punnen, and A.S. Schulz [2004], Approximate local search in combinatorial optimization, SIAM Journal on Computing 33, 1201–1214.

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H., and K. Steiglitz [1978], Some examples of difficult traveling salesman problems, Operations Research 26, 434–443.

    Article  MathSciNet  MATH  Google Scholar 

  • Papadimitriou, C.H., and K. Steiglitz [1982], Combinatorial Optimization, Prentice-Hall.

    Google Scholar 

  • Papadimitriou, C.H., and K. Steiglitz [1977], On the complexity of local search for the traveling salesman problem, SIAM Journal on Computing 6, 76–83.

    Article  MathSciNet  MATH  Google Scholar 

  • Punnen, A.P., M. Margot, and S.N. Kabadi [2003], TSP heuristics: Domination analysis and complexity, Algorithmica 35, 111–127.

    Article  MathSciNet  MATH  Google Scholar 

  • Raghavachari, B. [1997], Algorithms for finding low degree structures, in: D.S. Hochbaum (ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Company, 266–295.

    Google Scholar 

  • Schuurman, P., and T. Vredeveld [2001], Performance guarantees of local search for multiprocessor scheduling, Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 370–382.

    Google Scholar 

  • Vredeveld, T. [2002], Combinatorial Approximation Algorithms: Guaranteed Versus Experimental Performance, Ph.D. thesis, Eindhoven University of Technology, The Netherlands.

    MATH  Google Scholar 

  • Schulz, A.S., R. Weismantel, and G.M. Ziegler [1995], 0/1-integer programming: Optimization and augmentation are equivalent, Proceedings of the 3rd Annual European Symposium on Algorithms, Corfu, Greece, 473–483.

    Google Scholar 

  • Yannakakis, M. [1997], Computational complexity, in: E.H.L. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization, Wiley, 19–55.

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2007). Performance Guarantees. In: Theoretical Aspects of Local Search. Monographs in Theoretical Computer Science, An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-35854-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-35854-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35853-4

  • Online ISBN: 978-3-540-35854-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation