Approximation Schemes for Metric Bisection and Partitioning

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 499-508

  Fernandez De La Vega, W ^a   Karpinski, Marek ^b,c   Kenyon, Claire ^d  

^a CNRS   (France)

^b UNIVERSITY OF BONN   (Germany)

^c YALE UNIVERSITY   (United States)

^d ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

METRIC BISECTION; POLYNOMIAL TIME APPROXIMATION SCHEMES (PTAS);

ALGORITHMS; CONSTRAINT THEORY; LINEAR PROGRAMMING; PROBABILITY; PROBLEM SOLVING; QUADRATIC PROGRAMMING; RANDOM PROCESSES; THEOREM PROVING;

POLYNOMIAL APPROXIMATION;

EID: 1842487510     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. N. Alon, W. Fernandez de la Vega, R. Kannan, and M. Karpinski, Random Sampling and MAX-CSP Problems, Proc. 34th ACM STOC (2002), pp. 232-239.
2. S. Arora, D. Karger, and M. Karpinski, Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems, Proc. 27th STOC (1995), pp. 284-293; J. Comput. System Sciences 58 (1999) 193-210.
3. S. Arora, D. Karger, and M. Karpinski, Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems, Proc. 27th STOC (1995), pp. 284-293; J. Comput. System Sciences 58 (1999) 193-210.
4. G. Bennet, Probability inequalities for sums of independent random variables, Journal of the American Statistical Association 57 (1962) 33-45
5. P. Berman and M. Karpinski, Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION, ECCC Technical Report, TR01-026, 2001, also in Proc. 29th ICALP (2002), LNCS 2380, Springer, 2002, pp. 623-632.
6. P. Berman and M. Karpinski, Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION, ECCC Technical Report, TR01-026, 2001, also in Proc. 29th ICALP (2002), LNCS 2380, Springer, 2002, pp. 623-632.
7. B. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour and M. Yannakakis, The Complexity of Multiterminal Cuts, SIAM J. Comput 23 (1994), pp. 864-894.
8. th ACM STOC (2002), pp. 534-543.
9. U. Feige and R. Krauthgamer, A Polylogarithmic Approximation of the Minimum Bisection, Proc. 41st IEEE FOCS (2000), pp. 105-115.
10. W. Fernandez de la Vega, MAX-CUT has a Randomized Approximation Scheme in Dense Graphs, Random Structures and Algorithms 8 (1996), pp.187-198
11. W. Fernandez de la Vega and Marek Karpinski, Polynomial time approximation of dense weighted instances of MAX-CUT, Random Structures and Algorithms 16 (2000), pp. 314-332.
12. th IEEE FOCS (1998), pp. 468-471, final version in J. Comput. System Sciences 63 (2001), pp. 531-541.
13. th IEEE FOCS (1998), pp. 468-471, final version in J. Comput. System Sciences 63 (2001), pp. 531-541.
14. W. Fernandez de la Vega, M.Karpinski, C. Kenyon, and Y. Rabani, Approximation schemes for clustering problems, Proc. 35th ACM STOC(2003), to appear.
15. A.M. Frieze and R. Kannan, The Regularity Lemma and Approximation Schemes for Dense Problems, Proc. 37th FOCS (1996), pp. 12-20.
16. A.M. Frieze and R. Kannan, Quick Approximation to Matrices and Applications, Combinatorica 19 (2) (1999), pp. 175-120.
17. O. Goldreich, S. Goldwasser and D. Ron, Property Testing and its Connection to Learning and Approximation, Proc. 37th IEEE FOCS (1996), pp. 339-348; J. ACM 45 (1998), pp. 653-750.
18. O. Goldreich, S. Goldwasser and D. Ron, Property Testing and its Connection to Learning and Approximation, Proc. 37th IEEE FOCS (1996), pp. 339-348; J. ACM 45 (1998), pp. 653-750.
19. M. Habib, C. MCDiarmid, J. Ramirez-Alfonsin, B. Reed (eds.), Probabilistic Methods for Algorithmic Discrete Mathematics, Concentration, Springer, 1998.
20. D.S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems, PWS, 1997.
21. W. Hoeflding, Probability inequalities for sums of bounded random variables, Journal of the American Statistical Association 58 (1963) 13-30.
22. P. Indyk, A Sublinear Time Approximation Scheme for Clustering in Metric Spaces, Proc. 40th IEEE FOCS (1999), 154-159.
23. th MFCS (2002), LNCS Vol. 2420, Springer, 2002, pp. 59-67.
24. C. MCDiarmid, Concentration, Probabilistic Methods for Algorithmic Disctrete Mathematics, M.Habib, C.MCDiarmid, J. Ramirez Alfonsin, B.Reed (Eds.), Springer 1998.
25. C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation and Complexity Classes, J. Comput. System Sciences, 43 (1991), pp. 425-440.
26. L.J. Schulman. Clustering for edge-cost minimization. Proc. 32nd ACM STOC (2000), pp. 547-555.
27. H. Saran and V. V. Vazirani Finding k-Cuts within Twice the Optimal, Proc. 32nd IEEE FOCS (1991), pp. 743-751.