Go-With-The-Winners Heuristic

Authors:
Umesh V. Vazirani
Affiliations:
-
Venue:
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Year:
1999

Citing 3
Cited 0

Towards an analysis of local optimization algorithms

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Go with the winners for graph bisection

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
"Go with the winners" algorithms

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.