Polynomial time approximation schemes for dense instances of script N ℘-hard problems

Journal of Computer and System Sciences

Volumn 58, Issue 1, 1999, Pages 193-210

  Arora, Sanjeev ^a   Karger, David ^b   Karpinski, Marek ^c  

^a PRINCETON UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; RANDOM PROCESSES;

POLYNOMIAL TIME APPROXIMATION SCHEMES (PTAS);

APPROXIMATION THEORY;

EID: 0033077325     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1998.1605     Document Type: Article

References (49)

1. S. Arora, A. Frieze, and H. Kaplan, A new rounding procedure for the assignment problem with applications to dense graph arrangement problems, in "37th Annual Symposium on Foundations of Computer Science," pp. 21-30, IEEE Computer Society Press, Los Alamitos, CA, 1996.
2. N. Alon, A. Frieze, and D. Welsh, Polynomial time randomized approximation schemes for the tutte polynomial of dense graphs, in "Proceedings of the 35th Annual Symposium on the Foundations of Computer Science [IEE94]," pp. 24-35.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and hardness of approximation problems, in "Proceedings of the 33rd Annual Symposium on the Foundations of Computer Science [IEE92]," pp. 14-23.
4. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, Assoc. Comput. Mach. 45, No. 1 (1998), 70-122. [Prelim, version in "Proceedings of the 33rd Annual Symposium on the Foundations of Computer Science [IEE92]," pp. 2-13]
5. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, Assoc. Comput. Mach. 45, No. 1 (1998), 70-122. [Prelim, version in "Proceedings of the 33rd Annual Symposium on the Foundations of Computer Science [IEE92]," pp. 2-13]
6. T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser, Graph bisection algorithms with good average case behavior, in "Proceedings of the 25th Annual Symposium on the Foundations of Computer Science," pp. 181-192, IEEE Comput. Soc. Press, Los Alamitos, CA, 1984.
7. M. Bellare, O. Goldreich, and S. Goldwasser, Randomness in interactive proofs, Comput. Complexity 3 (1993), 319-354. [Abstract in IEEE FOCS, 1990]
8. R. B. Boppana, Eigenvalues and graph bisection: an average-case analysis, in "Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science," pp. 280-285, IEEE Comput. Soc. Press, Los Alamitos, CA, 1987.
9. M. Bellare and J. Rompel, Randomness-efficient oblivious sampling, in "Proceedings of the 35th Annual Symposium on the Foundations of Computer Science [IEE94],"pp. 276-287.
10. M. E. Dyer, A. Frieze, and R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies, J. Assoc. Comput. Mach. 38 (1991), 1-17.
11. E. Dahlhaus, D. S. Jonhson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis, The complexity of multiterminal cuts, SIAM J. Comput. 23, No. 4 (1994), 864-894. [A preliminary version appeared in ACM STOC 1992]
12. K. Edwards, The complexity of colouring problems on dense graphs, Theoret. Comput. Sci. 43 (1986), 337-343.
13. U. Feige and M. X. Goemans, Approximating the value of 2-prover proof systems, with applications to max-2sat and max-dicut, in "Proceedings of the Israeli Symposium on Theoretical Computer Science, 1995," pp. 182-189.
14. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating clique is almost NP-complete, in "Proceedings of the 32nd Annual Symposium on the Foundations of Computer Science," pp. 2-12, IEEE Comput. Soc. Press, 1991.
15. W. Fernandez de la Vega, MAXCUT has a randomized approximation scheme in dense graphs, Random Structures & Algorithms 8, No. 3 (1996), 187-198.
16. W. Fernandez de la Vega and G. S. Lueker, Bin packing can be solved within 1+εin linear time, Combinatorical 1, No. 4 (1981), 349-355.
17. A. Frieze and R. Kannan, The regularity lemma and approximation schemes for dense problems, in "Proceedings of the 37th Annual Symposium on the Foundations of Computer Science," pp. 12-20, IEEE Comput. Soc. Press, New York, 1996.
18. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, in "37th Annual Symposium on Foundations of Computer Science," pp. 339-348, IEEE Comput. Soc. Press, New York, 1996.
19. D. Gillman, A Chernoff bound for random walks on expanders, in "Proceedings of the 34th Annual Symposium on the Foundations of Computer Science [IEE93]," pp. 680-691.
20. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
21. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach. 42, No. 6 (1995), 1115-1145. [Extended abstract in "Proceedings of the 26th ACM Symposium on Theory of Computing," pp. 422-431, Assoc. Comput. Mach., New York, 1994]
22. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach. 42, No. 6 (1995), 1115-1145. [Extended abstract in "Proceedings of the 26th ACM Symposium on Theory of Computing," pp. 422-431, Assoc. Comput. Mach., New York, 1994]
23. 1-ε, in "Proceedings of the 37th Annual Symposium on the Foundations of Computer Science," pp. 627-636, IEEE Comput. Soc. Press, Los Alamitos, CA, 1996.
24. J. Håstad, Some optimal inapproximability results, in "Proceedings of the 28th ACM Symposium on Theory of Computing, 1997," pp. 1-10.
25. W. Höffding, Probability inequalities for sums of bounded random variables, J. Am. Statist. Assoc. 58, No. 301 (1964), 13-30.
26. "Proceedings of the 33rd Annual Symposium on the Foundations of Computer Science," IEEE Comput. Soc. Press, Los Alamitos, CA, 1992.
27. "Proceedings of the 34th Annual Symposium on the Foundations of Computer Science," IEEE Comput. Soc. Press, Los Alamitos, CA, 1993.
28. "Proceedings of the 35th Annual Symposium on the Foundations of Computer Science," IEEE Comput. Soc. Press, Los Alamitos, CA, 1994.
29. O. H. Ibarra and C. E. Kim, Fast approximation algorithms for the knapsack and sum of subsets problems, J. Assoc. Comput. Mach. 22, No. 4 (1975), 463-468.
30. M. Jerrum and A. Sinclair, Approximating the permanent, SIAM J. Comput. 18, No. 6 (1989), 1149-1178.
31. M. Jerrum and G. B. Sorkin, Simulated annealing for graph bisection, in "Proceedings of the 34th Annual Symposium on the Foundations of Computer Science [IEE93]," pp. 94-103.
32. H. Karloff and U. Zwick, A (7/8) - ε approximation for MAX-3SAT?, in "Proceedings of the 37th Annual Symposium on the Foundations of Computer Science, 1997."
33. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4, No. 4 (1984), 373-395.
34. N. Karmakar and R. M. Karp, An efficient approximation scheme for the one-dimensional bin-packing problem, in "Proceedings of the 23rd Annual Symposium on the Foundations of Computer Science," pp. 312-320, IEEE Comput. Soc. Press, Los Alamitos, CA, 1982.
35. R. M. Karp, M. Luby, and N. Madras, Monte-Carlo approximation algorithms for enumeration problems, J. Algorithms 10, No. 3 (1989), 429-448.
36. S. Khanna, M. Sudan, and D. Williamson, A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction, in "Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997," pp. 11-20.
37. E. Koutsoupias and C. H. Papadimitriou, On the greedy heuristic for satisfiability, Inform. Process. Lett. 43, No. 1 (1992), 53-55.
38. G. Kortsarz and D. Peleg, On choosing a dense subgraph, in "Proceedings of the 34th Annual Symposium on the Foundations of Computer Science [IEE93]," pp. 692-701.
39. T. Leighton and S. Rao, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, in "Proceedings of the 29th Annual Symposium on the Foundations of Computer Science," pp. 422-431, IEEE Comput. Soc. Press, Los Alamitos, CA, 1988.
40. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, in "Proceedings of the 25th ACM Symposium on Theory of Computing," pp. 286-293, Assoc. Comput. Mach., New York, 1993.
41. L. Pòsa, Hamiltonian circuits in random graphs, Discrete Math. 14 (1976), 359-364.
42. C. H. Papadimitriou, "Computational Complexity," Addison-Wesley, Reading, MA, 1994.
43. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, JCSS 43, No. 3 (1991), 425-440. [A preliminary version appeared in STOC 1988]
44. P. Raghavan, Probabilistic construction of deterministic algorithms: Approximate packing integer programs, J. Comput. System Sci. 37, No. 2 (1988), 130-43.
45. P. Raghavan and C. D. Thompson, Randomized rounding: A technique for provably good algorithms and algorithmic proofs, Combinatorica 7, No. 4 (1987), 365-374.
46. S. Sahni, Approximate algorithms for the 0/1 knapsack problem, J. Assoc. Comput. Mach. 22, No. 1 (1975), 115-124.
47. H. Saran and V. V. Vazirani, Finding k-cuts within twice the optimal, in "Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, October, 1991," pp. 743-751, IEEE Computer Soc. Press, Los Alamitos, CA, 1992.
48. D. Shmoys, Computing near-optimal solutions to combinatorial optimization problems, in "Combinatorial Optimization," DIMACS Series in Discrete Math and Theoretical Computer Science (W. Cook, L. Lovasz, and P. D. Seymour, Eds.), pp. 355-397, Am. Math. Soc., Providence, RI, 1995.
49. M. Yannakakis, On the approximation of maximum satisfiability, in "Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, January 1992," pp. 1-9.