New hardness results for congestion minimization and machine scheduling

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 28-34

  Chuzhoy, Julia ^a   Naor, Joseph ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation Algorithms; Congestion Minimization; Hardness of Approximation; Machine Scheduling; Routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

CONGESTION MINIMIZATION; EDGE DISJOINT PATHS (EDP) PROBLEMS; FLOW RELAXATION YIELDS; ROUTING;

COMPUTATIONAL COMPLEXITY;

EID: 4544282406     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007364     Document Type: Conference Paper

References (20)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal, of the ACM, 45(1):70-122, 1998.
3. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber. A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 48(5): 1069-1090, 2001.
4. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Approximating the throughput of multiple machines under real-time scheduling. SIAM Journal on Computing, 31:331-352, (2001).
5. P. Berman and B. DasGupta. Multi-phase algorithms for throughput maximization for real-time scheduling. Journal of Combinatorial Optimization, 4(3):307-323, 2000.
6. C. Chekuri and S. Khanna. Edge disjoint paths revisited. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, pages 628-637, 2003.
7. J. Chuzhoy, S. Guha, S. Khanna, and J. Naor. Approximation algorithms for machine scheduling. Manuscript, 2003.
8. J. Chuzhoy, R. Ostrovsky, and Y. Rabani. Approximation algorithms for the job interval selection problem and related scheduling problems. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, pages 348-356, 2001.
9. I. Dinur, V. Guruswami, and S. Khot. Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k - 3 - ε). ECCC Report TR02-027, Electronic Colloquium on Computational Complexity, 2002.
10. I. Dinur, V. Guruswami, S. Khot, and O. Regev. A new multilayered PCP and the hardness of hypergraph vertex cover. In Proceedings of the 35th ACM Symposium on Theory of Computing, pages 595-601, 2003.
11. T. Erlebach and F. C. R. Spieksma. Interval selection: Applications, algorithms, and lower bounds. J. Algorithms, 46(1):27-53, 2003.
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
13. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 19-28, 1999.
14. E. Halperin and R. Krauthgamer. Polylogarithmic inapproximability. In Proceedings of the 35th ACM Symposium on Theory of Computing, pages 585-594, 2003.
15. S. Khanna, M. Sudan, L. Trevisan and D.P. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing (SICOMP), 30(6), pages 1863-1920, 2000.
16. S. Khanna, M. Sudan, and L. Trevisan. Constraint satisfaction: the approximability of minimization problems. in Proc. 12th Annual IEEE Computational Complexity Conference (CCC), pages 282-296, 1997.
17. S. Khanna, M. Sudan and D.P. Williamson. A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction. In Proc. 29th Annual ACM Symposium on Theory of Computing (STOC), pages 11-20, 1997.
18. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: Algorithms and complexity. In Handbooks in Operations Research and Management Science, Vol. 4: Logistics for Production and Inventory, pages 445-522, North Holland, 1993.
19. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
20. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.