Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling

We consider (uniform) sparsest cut, optimal linear arrangement and the precedence constrained scheduling problem 1 |prec| SigmawjCj-So far, these three notorious NP-hard problems have resisted all attempts to prove inapproximability results. We show that they have no polynomial time approximation scheme (PTAS), unless NP-complete pmblems can be solved in randomized subexponential time. Furthermore, we prove that the scheduling problem is as-hard to approximate as vertex cover when the so-called fixed cost, that is present in all feasible solutions, is subtracted from the objective function.

[1]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[2]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[3]  E. Lawler.  Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints , 1978 .

[4]  Karsten A. Verbeurgt.  Learning DNF under the uniform distribution in quasi-polynomial time , 1990, COLT '90.

[5]  W. Trotter,et al.  Combinatorics and Partially Ordered Sets: Dimension Theory , 1992 .

[6]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[7]  David B. Shmoys,et al.  Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.

[8]  Andreas S. Schulz.  Scheduling to Minimize Total Weighted Completion Time: Performance Guarantees of LP-Based Heuristics and Lower Bounds , 1996, IPCO.

[9]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[10]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[11]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[12]  Gerhard J. Woeginger,et al.  Polynomial time approximation algorithms for machine scheduling: ten open problems , 1999 .

[13]  Rajeev Motwani,et al.  Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine , 1999, Discret. Appl. Math..

[14]  Fabián A. Chudak,et al.  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine , 1999, Oper. Res. Lett..

[15]  Dana Ron,et al.  Testing Problems with Sublearning Sample Complexity , 2000, J. Comput. Syst. Sci..

[16]  U. Feige.  Relations between average case complexity and approximation complexity , 2002, STOC '02.

[17]  Dana Ron,et al.  Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..

[18]  Maurice Queyranne,et al.  Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem , 2003, Oper. Res..

[19]  Nicolai N. Pisaruk,et al.  A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time , 2003, Discret. Appl. Math..

[20]  Noga Alon,et al.  Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.

[21]  Guy Kindler,et al.  Testing juntas , 2002, J. Comput. Syst. Sci..

[22]  Dana Ron,et al.  Testing polynomials over general fields , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[23]  Subhash Khot.  Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique , 2004, FOCS.

[24]  Hana Chockler,et al.  A lower bound for testing juntas , 2004, Inf. Process. Lett..

[25]  Atri Rudra,et al.  Testing Low-Degree Polynomials over Prime Fields , 2004, FOCS.

[26]  Luca Trevisan,et al.  Inapproximability of Combinatorial Optimization Problems , 2004, Electron. Colloquium Comput. Complex..

[27]  Satish Rao,et al.  New Approximation Techniques for Some Linear Ordering Problems , 2005, SIAM J. Comput..

[28]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[29]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[30]  José R. Correa,et al.  Single-Machine Scheduling with Precedence Constraints , 2005, Math. Oper. Res..

[31]  Yuval Rabani,et al.  ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[32]  Nisheeth K. Vishnoi,et al.  Integrality gaps for sparsest cut and minimum linear arrangement problems , 2006, STOC '06.

[33]  Monaldo Mastrolilli,et al.  Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem , 2006, ESA.

[34]  Ola Svensson,et al.  Approximating Precedence-Constrained Single Machine Scheduling by Coloring , 2006, APPROX-RANDOM.

[35]  James R. Lee,et al.  An improved approximation ratio for the minimum linear arrangement problem , 2007, Inf. Process. Lett..

[36]  Ola Svensson,et al.  Scheduling with Precedence Constraints of Low Fractional Dimension , 2007, IPCO.