On the deterministic complexity of searching local maxima

DOI10.1016/0166-218X(93)90002-6zbMath0777.05069OpenAlexW2000792827MaRDI QIDQ1801675

Ingo Althöfer, Klaus-Uwe Koschnick

Publication date: 17 August 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90002-6

zbMATH Keywords

boundsgridslocal maximadeterministic complexity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Query complexity of approximate equilibria in anonymous games ⋮ Search for the maximum of a random walk ⋮ Dividing and conquering the square

Cites Work

• Local optimization on graphs
• Edge-isoperimetric inequalities in the grid