Finding small balanced separators

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 375-384

  Feige, Uriel ^a   Mahdian, Mohammad ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Fixed parameter tractability; VC dimension

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; NUMERICAL METHODS; PROBLEM SOLVING;

BALANCED SEPARATORS; BOUNDED DEGREE GRAPHS; FIXED PARAMETER TRACTABILITY; VC DIMENSION;

GRAPH THEORY;

EID: 33748118909     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132573     Document Type: Conference Paper

References (22)

1. N. Alon and J. Spencer. The Probabilistic Method. Wiley-Interscience, 2000.
2. S. Arora, S. Rao, U. Vazirani. quot;Expander flows, geometric embeddings and graph partitioning.quot; STOC 2004, 222-231.
3. Y. Bilu, N. Linial. quot;Are stable instances easy?quot;. Manuscript, 2004.
4. A. Blumer, A. Ehrenfeucht, D. Haussler, M. Warmuth. quot;Learnability and the Vapnik-Chervonenkis dimension.quot; J. ACM 36(4), 929-965 (1989).
5. B. Chazelle. The Discrepency Method. Cambridge University Press, 2000.
6. R. Downey, M. Fellows. Parameterized Complexity. Springer, 1999.
7. J. Fakcharoenphol. MSc thesis, Berkeley.
8. U. Feige, M. Hajiaghayi, J. Lee. quot;Improved approximation algoritms for minimum-weight vertex separatorsquot;. Proceedings of 37th STOC, 2005, 563-572.
9. U. Feige, and J. Kilian. quot;On Limited versus Polynomial Nondeterminism.quot; Chicago J. Theor. Comput. Sci., 1997.
10. U. Feige, R. Krauthgamer. quot;A Polylogarithmic Approximation of the Minimum Bisection.quot; SIAM J. Comput. 31(4), 1090-1118 (2002).
11. U. Feige, O. Yahalom. quot;On the complexity of finding balanced oneway cutsquot;. Inf. Process. Lett. 87(1), 1-5 (2003)
12. M. Furer, B. Raghavachari. quot;Approximating the minimum degree spanning tree to within one from the optimal degree.quot; In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '92), pages 317-324, 1992.
13. D. Haussler, E. Welzl. quot;Epsilon-Nets and Simplex Range Queries.quot; Discrete and Computational Geometry 2, 127-151 (1987).
14. J. Kleinberg. quot;Detecting a Network Failure.quot; Internet Mathematics 1, No. 1, 37-56, 2003. Conference version appeared in FOCS 2000.
15. J. Kleinberg, M. Sandler, A. Slivkins. quot;Network failure detection and graph connectivity.quot; SODA 2004, 76-85.
16. J. Komlos, J. Pach, G. Woeginger. quot;Almost Tight Bounds for epsilon-Nets.quot; Discrete and Computational Geometry 7, 163-173 (1992).
17. F. T. Leighton, S. Rao. quot;Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms.quot; J. ACM 46(6) 787-832 (1999).
18. J. Matousek. Geometric Discrepency. Springer, 1999.
19. D. Marx. quot;Parameterized graph separation problems.quot; International Workshop on Parameterized and Exact Computation (IWPEC), 2004 (Bergen), 71-82, Lecture Notes in Comput. Sci., 3162, Springer, Berlin, 2004.
20. J. Pach, P. Agarwal. Combinatorial Geometry. Wiley, 1995.
21. A. Schrijver. Combinarorial Optimization (Volume C). Springer, 2003.
22. V. Vapnik, A. Chervonenkis. quot;On the uniform convergence of relative frequencies of events to their probabilities.quot; Theory of Probability and its Applications 16 (1971), 264-280.