Polynomial time approximation schemes for some dense instances of NP-hard optimization problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1269, Issue , 1997, Pages 1-14

  Karpinski, Marek ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES;

NP-HARD; OPTIMIZATION PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEMES;

OPTIMIZATION;

EID: 84957649710     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63248-4_1     Document Type: Conference Paper

References (41)

1. [AFW95] N. Alon, A. Frieze and D. Welsh, Polynomial Time Randomized Approximation Schemes for the Tutte Polynomial of Dense Graphs, Random Structures and Algorithms 6 (1995), pp. 459-478.
2. [AFK96] S. Arora, A. Frieze and H. Kaplan, A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangements, Proc. 37th IEEE FOCS (1996), pp. 21-30.
3. [AKK95] S. Arora, D. Karger, and M. Karpinski, Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems, Proc. 27th ACM STOC (1995), pp. 284-293.
4. [AL97] S. Arora and C. Lund, Hardness of Approximations, in Approximation Algorithms for NP-Hard Problems (D. Hochbaum, ed.), PWS Publ. Co. (1997), pp. 399-446.
5. [ALMSS92] S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof Verification and Hardness of Approximation Problems, Proc. 33rd IEEE FOCS (1992), pp. 14-20.
6. [BP89] M. Bern and P. Plassmann, The Steiner Problem with Edge Lengths 1 and 2, Inform. Process. Lett. 32 (1989), pp. 171-176.
7. [B86] A.Z. Broder, How Hard is it to Marry at Random (On the Approximation of the Permanent), Proc. 18th ACM STOC (1986), pp. 50-58, Erratum in Proc. 20th ACM STOC (1988), p. 551.
8. [CCDG82] P. Chinn, J. Chvatalova, A. Dewdney, N. Gibbs, The Bandwidth Problem for Graphs and Matrices - A Survey, Journal of Graph Theory 6 (1982), pp. 223-254.
9. [CT96] A. dementi and L. Trevisan, Improved Nonapproximability Result for Vėr- tex Cover with Density Constraints, Proc. 2nd Int. Conference, COCOON '96, Springer-Verlag (1996), pp. 333-342.
10. [DSS94] J. Diaz, M. Serna and P. Spirakis, Some Remarks on the Approximabílity of Graph Layout Problems, Technical Report LS1-94-16-R, Univ. Politec, Catalunya (1994).
11. [DFJ94] M.E. Dyer, A. Frieze and M.R. Jerrum, Approximately Counting Hamilton Cycles in Dense Graphs, Proc. 4th ACM-SIAM SODA (1994), pp. 336-343.
12. [F96] U. Feige, A Threshold of In n for Approximating Set Cover, Proc. 28th ACM STOC (1996), pp. 314-318.
13. [FV96] W. Femandez-de-la-Vega, MAX-CUT has a Randomized Approximation Scheme in Dense Graphs, Random Structures and Algorithms 8 (1996), pp. 187- 999.
14. [FK97] W. Fernandez-de-la-Vega and M. Karpinski, Polynomial Time Approximabil- íty of Dense Weighted Instances of MAX-CUT, Research Report No. 85171-CS, University of Bonn (1997).
15. [FL81] W. Femandez-de-la-Vega, G. S. Lueker, Bin Packing Can be Solved Withm 1+ε in Linear Time, Combinatorica 1 (1981), pp. 349-355.
16. [FK96] A. Frieze and R. Kannan, The Regularity Lemma and Approximation Schemes for Dense Problems, Proc. 37th IEEE FOCS (1996), pp. 12-20.
17. [FK97] A. Frieze and R. Kannan, Quick Approximation to Matrices and Applications, Manuscript (1997).
18. [GGJK78] M. Garey, R. Graham, D. Johnson, D. Knuth, Complexity Results for Bandwidth Minimization, SIAM J. Appl. Math, 34 (1978), pp. 477-495.
19. [GJ79] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. FYeeman (1979).
20. [GW94] M. Goemans and D. Williamson,,878-approximatton Algorithms for MAX- CUT and MAX2SAT, Proc. 26th ACM STOC (1994), pp. 422-431.
21. [GGR96] O. Gołdreich, S. Goldwasser and D. Ron, Property Testing and its Connection to Learmng and Approximation, Proc. 37th IEEE FOCS (1996), pp. 339-348.
22. [HMM91] J. Harałambides, F. Makedon, B. Morien, Bandwidth Minimization: An Approximation Algorithm for Caterpillars, Math. Systems Theory 24 (1991), pp. 169- 177.
23. 1-ε, Proc. 37th IEEE FOCS (1986), pp. 627-636.
24. [H97] D. Hochbaum, Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems, in Approximation Algorithms for NP-hard Problems (D. Hochbaum, ed.), PWS Publ. Co. (1997), pp. 94-143.
25. [IK75] O. H. Ibarra, C. E. Kim, Fast Approximation Algorithms for the Knapsack and Sum of Subsets Problems, J. ACM 22 (1975), pp. 463-468.
26. [JS89] M. R. Jerrum and A. Sinclair, Approximating the Permanent, SIAM J. Comput. 18 (1989), pp. 1149-1178.
27. [J94] D. S. Johnson, Approximation Algorithms for Combinatorial Problems, J. Comput. System Sciences 9 (1974), pp. 256-278.
28. [KK82] N. Karmarkar and R. M. Karp, An Efficient Approximation Scheme for the One-dimensional Bin-Packing Problem, Proc. 23rd IEEE FOCS (1982), pp. 312- 320.
29. [K72] R.M. Karp, Reducibility among Combinatorial Problems, in Complexity of Computer Computations (R. Miller and J. Thatcher, ed.), Plenum Press (1972), pp. 85-103.
30. [KWZ97] M. Karpinski, J. Wirtgen and A. Zelikovsky, An Approximation Algorithm for the Bandwidth Problem on Dense Graphs, ECCC Technical Report TR 97-017 (1997).
31. [KZ96] M. Karpinski and A. Zelikovsky, Approximating Dense Cases of Covering Problems (Preliminary Version), Technical Report TR-96-059, International Computer Science Institute, Berkeley (1996).
32. [KZ97a] M. Karpinski and A. Zelikovsky, New Approximation Algorithms for the Steiner Tree Problem, J. of Combinatorial Optimization 1 (1997), pp. 47-65.
33. [KZ97b] M. Karpinski and A. Zelikovsky, Approximating Dense Cases of Covering Problems, ECCC Technical Report TR 97-004, 1997, to appear in Proc. DIMACS Workshop on Network Design: Connectivity and Facilities Location, Princeton (1997).
34. [KP93] G. Kortsarz and D. Peleg, On Choosing a Dense Subgraph, Proc. 34th IEEE FOCS (1993), pp. 692-701.
35. [M83] B. Monien, The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete, SIAM J. Alg. Disc. Math. 7 (1986), pp. 505-514.
36. [P94] C. Papadimitriou, Computational Complexity, Addison-Wesley, (1994).
37. [PY91] C. Papadimitriou and M. Yannakakis, Optmization, Approximation and Complexity Classes, J. Comput. System Sciences 43 (1991), pp. 425-440.
38. [PY96] C. Papadimitriou and M. Yannakakis, On Limited Nondeterminism and the Complexity of the VC-dimension, J. Comput. System Sciences 53 (1996), pp. 161- 170.
39. [R88] P. Raghavan, Probabilistic Construction of Deterministic Algorithms: Approximate Packing Integer Programs, J. Comput. System Sciences 37 (1988), pp. 130-143.
40. [Sm95] L. Smithline, Bandwidth of the Complete k-ary Tree, Discrete Mathematics 142 (1995), pp. 203-212.
41. [Y92] M. Yannakakis, On the Approximation of Maximum Satisfiability, Proc. 3rd ACM-SIAM SODA (1992), pp. 1-9.