Conditional hardness of precedence constrained scheduling on identical machines
Proceedings of the forty-second ACM symposium on Theory of computing
Inapproximability of hypergraph vertex cover and applications to scheduling problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Mathematics of Operations Research
Vertex cover in graphs with locally few colors
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the Approximability of Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research
Hardness of Precedence Constrained Scheduling on Identical Machines
SIAM Journal on Computing
Ranking with submodular valuations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On LP-based approximability for strict CSPs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The feedback arc set problem with triangle inequality is a vertex cover problem
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Mathematics of Operations Research
Vertex cover in graphs with locally few colors
Information and Computation
Single machine scheduling with scenarios
Theoretical Computer Science
Approximation resistance from pairwise independent subgroups
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
For arbitrarily small constants epsilon, delta 0$, we present a long code test with one free bit, completeness 1-epsilon and soundness delta. Using the test, we prove the following two inapproximability results:1. Assuming the Unique Games Conjecture of Khot, given an n-vertex graph that has two disjoint independent sets of size (1/2-epsilon)n each, it is NP-hard to find an independent set of size delta n.2. Assuming a (new) stronger version of the Unique Games Conjecture, the scheduling problem of minimizing weighted completion time with precedence constraints is inapproximable within factor 2-epsilon.