New hardness results for congestion minimization and machine scheduling

Journal of the ACM

Volumn 53, Issue 5, 2006, Pages 707-721

  Chuzhoy, Julia ^a   Naor, Joseph ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Congestion minimization; Hardness of approximation; Network routing; Resource minimization; Scheduling

Indexed keywords

CONGESTION MINIMIZATION; HARDNESS OF APPROXIMATION; NETWORK ROUTING; RESOURCE MINIMIZATION;

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; RESOURCE ALLOCATION; ROUTERS;

CONGESTION CONTROL (COMMUNICATION);

EID: 33845322996     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/1183907.1183908     Document Type: Article

References (32)

1. ANDREWS, M., CHUZHOY, J., KHANNA, S., AND ZHANG, L. 2005. Hardness of the undirected edge-disjoint paths problem with congestion. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 226-244.
2. ANDREWS, M., AND ZHANG, L. 2005a. Hardness of the edge-disjoint paths problem with congestion. http://cm.bell-labs.com/cm/ms/who/andrews/edp- congestion.ps.
3. ANDREWS, M., AND ZHANG, L. 2005b. Hardness of the undirected congestion minimization. In Proceedings of the 37th ACM Symposium on Theory of Computing. ACM, New York, 284-293.
4. ANDREWS, M., AND ZHANG, L. 2005c. Hardness of the undirected edge-disjoint paths problem. In Proceedings of the 37th ACM Symposium on Theory of Computing. ACM, New York, 278-283.
5. ANDREWS, M., AND ZHANG, L. 2006. Logarithmic hardness of the directed congestion minimization problem. In Proceedings of the 38th ACM Symposium on Theory of Computing. ACM, New York, 517-526.
6. ARORA, S., LUND, C., MOTWANI, R., SUDAN, M., AND SZEGEDY, M. 1998. Proof verification and the hardness of approximation problems. J. ACM 45, 3, 501-555.
7. ARORA, S., AND SAFRA, S. 1998. Probabilistic checking of proofs: a new characterization of NP. J. ACM 45, 1, 70-122.
8. AZAR, Y., AND REGEV, O. 2001. Strongly polynomial algorithms for the unsplittable flow problem. In Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization. 15-29.
9. BAR-NOY, A., GUHA, S., NAOR, J., AND SCHIEBER, B. 2001. Approximating the throughput of multiple machines under real-time scheduling. SIAM J. Comput. 31, 331-352.
10. BAVEJA, A., AND SRINIVASAN, A. 2000. Approximation algorithms for disjoint paths and related routing and packing problems. Math. Oper. Res. 25, 255-280.
11. BERMAN, P., AND DASGUPTA, B. 2000. Multi-phase algorithms for throughput maximization for real-time scheduling. J. Combin. Opt. 4, 3 (Sept.), 307-323.
12. CHEKURI, C., AND KHANNA, S. 2003. Edge disjoint paths revisited. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 628-637.
13. CHEKURI, C., KHANNA, S., AND SHEPHERD, F. B. 2004. Edge disjoint paths in planar graphs. In Proceedings of the 45th IEEE Annual Symposium on Foundations of Computer Science. IEEE Computer Socitety Press, Los Alamitos, CA, 71-80.
14. CHEKURI, C., KHANNA, S., AND SHEPHERD, F. B. 2005. Multicommodity flow, well-linked terminals, and routing problems. In Proceedings of the 37th ACM Symposium on Theory of Computing. ACM, New York, 183-192.
15. CHEKURI, C., KHANNA, S., AND SHEPHERD, F. B. 2006a. Edge-disjoint paths in planar graphs with constant congestion. In Proceedings of the 38th ACM Symposium on Theory of Computing. ACM, New York, 757-766.
16. CHEKURI, C., KHANNA, S., AND SHEPHERD, F. B. 2006b. An o(√n) approximation for edp in undirected graphs and directed acyclic graphs. Theory of Computing 2, 137-146.
17. CHUZHOY, J., GUHA, S., KHANNA, S., AND NAOR, J. 2004. Machine minimization for scheduling jobs with interval constraints. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 81-90.
18. CHUZHOY, J., AND KHANNA, S. 2005. New hardness results for undirected edge disjoint paths. Manuscript, http://www.cis.upenn.edu/~cisfac/sanjeev/pubs. html/postscript/edpwchardness.ps.gz.
19. CHUZHOY, J., AND KHANNA, S. 2006. Hardness of directed routing with congestion. Tech. Rep. TR06-109, Electronic Colloquium on Computational Complexity (ECCC).
20. CHUZHOY, J., OSTROVSKY, R., AND RABANI, Y. 2001. Approximation algorithms for the job interval selection problem and related scheduling problems. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 348-356.
21. DINUR, I., GURUSWAMI, V., AND KHOT, S. 2002. Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k - 3 - ε). Tech. Rep. TR02-027, Electronic Colloquium on Computational Complexity (ECCC).
22. DINUR, I., GURUSWAMI, V., KHOT, S., AND REGEV, O. 2003. A new multilayered PCP and the hardness of hypergraph vertex cover. In Proceedings of the 35th ACMSymposium on Theory of Computing. ACM, New York, 595-601.
23. ERLEBACH, T., AND SPIEKSMA, F. C. R. 2003. Interval selection: Applications, algorithms, and lower bounds. J. Algorithms 46, 1, 27-53.
24. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
25. GURUSWAMI, V., KHANNA, S., RAJARAMAN, R., SHEPHERD, B., AND YANNAKAKIS, M. 2003. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67, 3, 473-496.
26. KLEINBERG, J. M. 1996. Approximation algorithms for disjoint paths problems. Ph.D. dissertation. MIT, Cambridge, MA.
27. KOLLIOPOULOS, S. G., AND STEIN, C. 1998. Approximating disjoint-path problems using greedy algorithms and packing integer programs. In Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization. ACM, New York, 153-168.
28. LAWLER, E. L., LENSTRA, J. K., KAN, A. H. G. R., AND SHMOYS, D. B. 1993. Sequencing and scheduling: Algorithms and complexity. In Handbooks in Operations Research and Management Science, vol. 4: Logistics for Production and Inventory. North Holland, Amsterdam, The Netherlands, 445-522.
29. RAGHAVAN, P., AND THOMPSON, C. D. 1987. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365-374.
30. RAZ, R. 1998. A parallel repetition theorem. SIAM J. Comput. 27, 3, 763-803.
31. SRINIVASAN, A. 1997. Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 416-425.
32. VARADARAJAN, K., AND VENKATARAMAN, G. 2004. Graph decomposition and a greedy algorithm for edge-disjoint paths. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 379-380.