Typical properties of winners and losers in discrete optimization

DOI10.1145/1007352.1007409zbMath1192.90156OpenAlexW1964402547MaRDI QIDQ3581000

Berthold Vöcking, Rene Beier

Publication date: 15 August 2010

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (4)

Decision-making based on approximate and smoothed Pareto curves ⋮ The diameter of randomly perturbed digraphs and some applications ⋮ The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes ⋮ Settling the Complexity of Local Max-Cut (Almost) Completely

This page was built for publication: Typical properties of winners and losers in discrete optimization