On cutting a few vertices from a graph

Discrete Applied Mathematics

Volumn 127, Issue 3, 2003, Pages 643-649

  Feige, Uriel ^a   Krauthgamer, Robert ^a   Nissim, Kobbi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximation algorithms; Dynamic programming; Graph partitioning; Random edge contraction

Indexed keywords

EID: 84867951886     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00394-3     Document Type: Article

References (6)

1. T.N. Bui, and C. Jones Finding good approximate vertex and edge partitions is NP-hard Inform. Process. Lett. 42 3 1992 153 159
2. U. Feige, R. Krauthgamer, A polylogarithmic approximation of the minimum bisection, in: 41st Annual IEEE Symposium on Foundations of Computer Science, Redonolo Beach, CA, USA, 2000, pp. 105-115.
3. U. Feige, R. Krauthgamer, K. Nissim, Approximating the minimum bisection size, in: 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, USA, 2000, pp. 530-536.
4. M.R. Garey, D.S. Johnson, and L. Stockmeyer Some simplified NP-complete graph problems Theoret. Comput. Sci. 1 3 1976 237 267
5. D.R. Karger, and C. Stein A new approach to the minimum cut problem J. ACM 43 4 1996 601 640
6. R. Motwani, and P. Raghavan Randomized Algorithms 1995 Cambridge University Press Cambridge