On the Hardness of Global and Local Approximation

Authors:
Hartmut Klauck
Affiliations:
-
Venue:
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Year:
1996

Citing 0
Cited 2

Approximate local search in combinatorial optimization

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Local search: simple, successful, but sometimes sluggish

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract