Abstract
Go-with-the-winners (GWW) is a simple but powerful paradigm for designing heuristics for NP-hard optimization problems. We give a brief survey of the theoretical basis as well as the experimental validation of this paradigm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aldous, D., Vazirani, U.: “Go with the winners” Algorithms. Proceedings of 35th IEEE Symposium on Foundations of Computer Science (FOCS), pages 492–501, 1994.
Carson, T., Impagliazzo, R.: Experimentally Determining Regions of Related Solutions for Graph Bisection Problems. Manuscript, 1999.
Dimitriou, A., Impagliazzo, R.: Towards a Rigorous Analysis of Local Optimization Algorithms. 28th ACM Symposium on the Theory of Computing, 1996.
Dimitriou, A., Impagliazzo, R.: Go-with-the-winners Algorithms for Graph Bisection. SODA 98, pages 510–520, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vazirani, U.V. (1999). Go-With-The-Winners Heuristic. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_22
Download citation
DOI: https://doi.org/10.1007/3-540-48447-7_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66279-2
Online ISBN: 978-3-540-48447-9
eBook Packages: Springer Book Archive