ComputingComputer ScienceMathematicsAlgorithmsOptimizationApproximation AlgorithmsComputational ComplexityComplexity-theoretic HardnessHardnessProblem Hardness
One of the cherished customs of childhood is choosing up sides for a ball game. Where I grew up, we did it this way: The two chief bullies of the neighborhood would appoint themselves captains of the opposing teams, and then they would take turns picking other players. On each round, a captain would choose the most capable (or, toward the end, the least inept) player from the pool of remaining candidates, until everyone present had been assigned to one side or the other. The aim of this ritual was to produce two evenly matched teams and, along the way, to remind each of us of our precise ranking in the neighborhood pecking order. It usually worked.
6
Where the really hard problems are
Peter Cheeseman, Bob Kanefsky, William M. Taylor · 1991 · 1K citations
The Differencing Method of Set Partitioning
Narenda Karmarker, Richard M. Karp · 1983 · 202 citations
Random Costs in Combinatorial Optimization
Stephan Mertens · Physical Review Letters · 2000 · 109 citations · Full text