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

Algorithmica (New York)

Volumn 30, Issue 3, 2001, Pages 386-397

  Karpinski, M ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Approximation algorithms; Combinatorial optimization; Dense instances; NP hardness; Polynomial time approximation schemes

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

COMBINATORIAL OPTIMIZATION;

COMPUTATIONAL COMPLEXITY;

EID: 0242301652     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0012-z     Document Type: Article

References (60)

1. N. Alon, A. Frieze, and D. Welsh, Polynomial Time Randomized Approximation Schemes for the Tutte Polynomial of Dense Graphs, Random Structures Algorithms 6 (1995), 459-178.
2. S. Arora, Polynomial Time Approximation Schemes for Euclidean TSP and other Geometric Problems, Proc. 37th IEEE FOCS (1996), pp. 2-12.
3. 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.
4. 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; the full version appeared in J. Comput. System Sci. 58 (1999), 193-210.
5. 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; the full version appeared in J. Comput. System Sci. 58 (1999), 193-210.
6. S. Arora and C. Lund, Hardness of Approximations, in Approximation Algorithms for NP-Hard Problems (D. Hochbaum, ed.), PWS, Boston, MA, 1997, pp. 399-446.
7. 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.
8. C. Bazgan and W. Fernandez de la Vega, A Polynomial Time Approximation Schemes for Dense MIN 2SAT, Proc. Fundamentals of Computation Theory (1999), LNCS 1684, Springer-Verlag, Berlin, 1999, pp. 91-99.
9. P. Berman and M. Karpinski, On Some Tighter Inapproximability Results, Proc. 26th ICALP (1999), LNCS 1644, Springer-Verlag, Berlin, 1999, pp. 200-209.
10. M. Bern and P. Plassmann, The Steiner Problem with Edge Lengths 1 and 2, Inform. Process. Lett. 32(1989), 171-176.
11. G. Blache, M. Karpinski, and J. Wirtgen, On Approximation Intractability of the Bandwidth Problem, ECCC Technical Report TR98-014, 1998.
12. 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 ACMSTOC (1988), p. 551.
13. P. Chinn, J. Chvatalova, A. Dewdney, and N. Gibbs, The Bandwidth Problem for Graphs and Matrices - A Survey, J. Graph Theory 6 (1982), 223-254.
14. A. Clementi and L. Trevisan, Improved Nonapproximability Result for Vertex Cover with Density Constraints, Proc. 2nd Internat. Conf., COCOON '96, Springer-Verlag, New York, 1996, pp. 333-342.
15. P. Crescensi and V. Kann, A Compendium of NP-Optimization Problems, 1998, available at URL http://www.nada.kth.se/∼viggo/index-en.html.
16. J. Diaz, M. Sema, and P. Spirakis, Some Remarks on the Approximability of Graph Layout Problems, Technical Report LSI-94-16-R, Univ. Politec, Catalunya (1994).
17. 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.
18. L. Engebretsen, An Explicit Lower Bound for TSP with Distances One and Two, Proc. 16th STACS (1999), LNCS 1563, Springer-Verlag, Berlin, 1999, pp. 371-382.
19. U. Feige, A Threshold of Inn for Approximating Set Cover, Proc. 28th ACM STOC (1996), pp. 314-318.
20. U. Feige, Approximating the Bandwidth via Volume Respecting Embeddings, Proc. 30th ACM STOC (1998), pp. 90-99.
21. U. Feige, Personal communication, March 2000.
22. W. Fernandez de la Vega, MAX-CUT has a Randomized Approximation Scheme in Dense Graphs, Random Structures Algorithms 8 (1996), 187-999.
23. W. Fernandez de la Vega and M. Karpinski, Polynomial Time Approximability of Dense Weighted Instances of MAX-CUT, Research Report No. 85171-CS, University of Bonn (1997); also in Random Structures and Algorithms 16 (2000), 314-332.
24. W. Fernandez de la Vega and M. Karpinski, Polynomial Time Approximability of Dense Weighted Instances of MAX-CUT, Research Report No. 85171-CS, University of Bonn (1997); also in Random Structures and Algorithms 16 (2000), 314-332.
25. W. Fernandez de la Vega and M. Karpinski, On Approximation Hardness of Dense TSP and Other Path Problems, ECCC Technical Report TR98-024 (1998); also in Inform. Process. Lett. 70 (1999), 53-55.
26. W. Fernandez de la Vega and M. Karpinski, On Approximation Hardness of Dense TSP and Other Path Problems, ECCC Technical Report TR98-024 (1998); also in Inform. Process. Lett. 70 (1999), 53-55.
27. W. Fernandez de la Vega and C. Kenyon, A Randomized Approximation Schemes for Metric MAX-CUT, Proc. 39th IEEE FOCS (1998), pp. 468-471.
28. W. Fernandez de la Vega and G. S. Lueker, Bin Packing Can Be Solved within 1 + ∈ in Linear Time, Combinatorica 1 (1981), 349-355.
29. D.A. Fotakis and P.G. Spirakis, Graph Properties that Facilitate Travelling, ECCC Technical Report TR98-031 (1998).
30. A. Frieze and R. Kannan, The Regularity Lemma and Approximation Schemes for Dense Problems, Proc. 37th IEEE FOCS (1996), pp. 12-20.
31. A. Frieze and R. Kannan, Quick Approximation to Matrices and Applications, Manuscript (1997).
32. M. Garey, R. Graham, D. Johnson, and D. Knuth, Complexity Results for Bandwidth Minimization, SIAM J. Appl. Math. 34 (1978), 477-495.
33. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Fransisco, CA, 1979.
34. M. Goemans and D. Williamson, .878-Approximation Algorithms for MAX-CUT and MAX2SAT, Proc. 26th ACM STOC (1994), pp. 422-431.
35. O. Goldreich, S. Goldwasser, and D. Ron, Property Testing and Its Connection to Learning and Approximation, Proc. 37th IEEE FOCS (1996), pp. 339-348.
36. J. Haralambides, F. Makedon, and B. Monien, Bandwidth Minimization: An Approximation Algorithm for Caterpillars, Math. Systems Theory 24 (1991), 69-177.
37. 1-∈, Proc. 37th IEEE FOCS (1986), pp. 627-636.
38. 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, Boston, MA, 1997, pp. 94-143.
39. O.H. Ibarra and C.E. Kim, Fast Approximation Algorithms for the Knapsack and Sum of Subsets Problems, J. Assoc. Comput. Mach. 22 (1975), 463-468.
40. M.R. Jerrum and A. Sinclair, Approximating the Permanent, SIAM J. Comput. 18 (1989), 1149-1178.
41. T. Jiang, P. Kearney, and M. Li, Orchestrating Quartets: Approximation and Data Correction, Proc. 39th IEEE FOCS (1998), pp. 416-425.
42. D.S. Johnson, Approximation Algorithms for Combinatorial Problems, J. Comput. System Sci. 9 (1974), 256-278.
43. 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.
44. R.M. Karp, Reducibility Among Combinatorial Problems, in Complexity of Computer Computations (R. Miller and J. Thatcher, eds.), Plenum, New York, 1972, pp. 85-103.
45. M. Karpinski and J. Wirtgen, On Approximation Hardness of the Bandwidth Problem, ECCC Technical Report TR97-041.
46. M. Karpinski, J. Wirtgen, and A. Zelikovsky, An Approximation Algorithm for the Bandwidth Problem on Dense Graphs, ECCC Technical Report TR 97-017 (1997).
47. M. Karpinski and A. Zelikovsky, New Approximation Algorithms for the Steiner Tree Problem, J. Combin. Optim. 1 (1997), 47-65.
48. M. Karpinski and A. Zelikovsky, Approximating Dense Cases of Covering Problems, ECCC Technical Report TR 97-004, 1997; Also in Proc. DIMACS Workshop on Netwrork Design: Connectivity and Facilities Location, Princeton, 1997, DIMACS Series in Discrete Mathmatics and Theoretical Computer Science 40, American Mathematical Society, Providence, RI, 1998, pp. 169-178.
49. M. Karpinski and A. Zelikovsky, Approximating Dense Cases of Covering Problems, ECCC Technical Report TR 97-004, 1997; Also in Proc. DIMACS Workshop on Netwrork Design: Connectivity and Facilities Location, Princeton, 1997, DIMACS Series in Discrete Mathmatics and Theoretical Computer Science 40, American Mathematical Society, Providence, RI, 1998, pp. 169-178.
50. M. Karpinski and A. Zelikovsky, Approximating Dense Cases of Covering Problems, ECCC Technical Report TR 97-004, 1997; Also in Proc. DIMACS Workshop on Netwrork Design: Connectivity and Facilities Location, Princeton, 1997, DIMACS Series in Discrete Mathmatics and Theoretical Computer Science 40, American Mathematical Society, Providence, RI, 1998, pp. 169-178.
51. G. Kortsarz and D. Peleg, On Choosing a Dense Subgraph, Proc. 34th IEEE FOCS (1993), pp. 692-701.
52. B. Monien, The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete, SIAM J. Alhgebraic Discrete Methods 7(1986), 505-514.
53. C. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
54. C. Papadimitriou and M. Yannakakis, Optimization, Approximation and Complexity Classes, J. Comput. System Sci. 43 (1991), 425-440.
55. C.H. Papadimitriou and M. Yannakakis, The Travelling Salesman Problem with Distances One and Two, Math. Oper. Res. 18 (1993), 1-11.
56. C. Papadimitriou and M. Yannakakis, On Limited Nondeterminism and the Complexity of the VC-dimension, J. Comput. System Sci. 53 (1996), 161-170.
57. P. Raghavan, Probabilistic Construction of Deterministic Algorithms: Approximate Packing Integer Programs, J. Comput. System Sci. 37 (1988), 130-143.
58. L. Smithline, Bandwidth of the Complete k-ary Tree, Discrete Math. 142 (1995), 203-212.
59. W. Unger, The Complexity of the Approximation of the Bandwidth Problem, Proc. 39th IEEE FOCS (1998), pp. 82-91.
60. M. Yannakakis, On the Approximation of Maximum Satisfiability, Proc. 3rd ACM-SIAM SODA (1992), pp. 1-9.