59 search results - page 5 / 12 » stoc 2002 |
STOC
2002
ACM
16 years 8 days ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
STOC
2002
ACM
16 years 8 days ago
2002
ACM
We prove that any Resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length (2n ), (for some global constant > 0).
58
Voted
STOC
2002
ACM
16 years 8 days ago
2002
ACM
STOC
2002
ACM
16 years 8 days ago
2002
ACM
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
STOC
2002
ACM
16 years 8 days ago
2002
ACM
The PD2 Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally scheduling periodic tasks on multiprocessors. In this paper, we prove that PD2 is als...