On the advantage over a random assignment

DOI10.1145/509907.509916zbMath1192.68902OpenAlexW1991815011MaRDI QIDQ5901050

No author found.

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.509916

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Kernelization – Preprocessing with a Guarantee ⋮ Parameterizing above or below guaranteed values

This page was built for publication: On the advantage over a random assignment