On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment

DOI10.1016/J.TCS.2012.10.044zbMATH Open1259.68090OpenAlexW1964024632MaRDI QIDQ1935800

Dominic Dumrauf, Burkhard Monien

Publication date: 19 February 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.044

zbMATH Keywords

complexitylocal searchlocally optimal solutions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

This page was built for publication: On the \(\mathcal {PLS}\)-complexity of maximum constraint assignment