On the hardness of global and local approximation

DOI10.1007/3-540-61422-2_123zbMATH Open0890.68073OpenAlexW1509240578MaRDI QIDQ4375641FDOQ4375641

Hartmut Klauck

Publication date: 8 February 1998

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_123

zbMATH Keywords

approximation of local optima

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (1)

• Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games

   Recommendations

• Title not available (Why is that?) 👍 👎
• A note on the complexity of local search problems 👍 👎
• Simple Local Search Problems that are Hard to Solve 👍 👎

This page was built for publication: On the hardness of global and local approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375641)