Sciweavers

STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 22 days ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking