Cutting Up is Hard to Do: The Parameterised Complexity of k-Cut and Related Problems

Electronic Notes in Theoretical Computer Science

Volumn 78, Issue , 2003, Pages 215-228

  Downey, Rodney G ^a   Estivill Castro, Vladimir ^b   Fellows, Michael ^c   Prieto, Elena ^c   Rosamund, Frances A ^c  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b GRIFFITH UNIVERSITY   (Australia)

^c UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; GRAPH THEORY; IMAGE PROCESSING; POLYNOMIALS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; VLSI CIRCUITS;

EDGE-WEIGHTED GRAPH; EDGE-WEIGHTING FUNCTIONS; GRAPH CLUSTERING; PLANAR GRAPHS;

COMPUTER SCIENCE;

EID: 18944393477     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)81014-4     Document Type: Conference Paper

References (33)

1. S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 2-12.
2. S. Arora, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. Proc.38th Annual IEEE Symposium on the Foundations of Computing(FOCS'97), IEEE Press 1997, 554-563.
3. Liming Cai, Chen J., Downey R., Fellows M. The parameterized complexity of short computation and factorization. Archive for Mathematical Logic. 36:1997;321-338
4. Liming Cai, M. Fellows, D. Juedes and F. Rosamond. Efficient polynomial-time approximation schemes for problems on planar structures: upper and lower bounds. Manuscript, 2001.
5. Liming Cai and D. Juedes. Subexponential parameterized algorithms collapse the W-hierarchy Proceeding of ICALP 2001, Crete, Greece, Springer-Verlag LNCS 2076 2001.
6. J. Chen, I.A. Kanj and W. Jia. vertex cover:further observations and further improvements. Proceedings of the 25th International Workshop on Graph-Theortic Concepts in Computer Science, (WG'99), Lecture Notes in Computer Science 1665 (1999), 313-324.
7. Dehne F. Private communication. 2002
8. Downey R.G., Fellows M.R. Fixed-parameter tractability and completeness I:basic theory. SIAM Journal of Computing. 24:1995;873-921
9. Downey R., Fellows M. Fixed-parameter tractability and completeness II:completeness for W[1]. Theoretical Computer Science A. 141:1995;109-131
10. Downey R., Fellows M. Parameterized Complexity. 1998;Springer-Verlag
11. R. Downey, M. Fellows, E. Prieto-Rodriguez and F. Rosamond. Fixed-Parameter tractability and completeness V:parametric miniatures. Manuscript in preparation, 2002.
12. Downey R., Fellows M., Vardy A., Whittle G. The parametrized complexity of some fundamental problems in coding theory. SIAM J. Computing. 29:1999;545-570
13. E. Dalhaus, D.S. Johnson, C.H. Papadimitriou, P. Seymour and M. Yannakakis. The complexity of multiway cuts. Proc. 24th Annual ACM Symp. on the Theory of Computing (STOC) (1992), 241-251.
14. M. Fellows. Parameterized complexity: the main ideas, connetions to heuritics and research frontiers. Proc. ISAAC 2001, Springer-Verlag, Lecture Notes in Computer Science, 2223 (2001), 291-307.
15. U. Feige, R. Krauthgamer and K. Nissin. Approximating the minimu bisection size. Proc. 32nd Annual ACM Symposium on the Theory of Computing (STOC) (2000), 530-536.
16. U. Feige, R. Krauthgamer and K. Nissim. On cutting a few vertices from a graph. Manuscript, 2001.
17. C. Friedrich, and, M.E. Graph Drawing in Motion II In Proceedings of the 9th International Symposium on Graph Drawing, Springer Verlag Lecture Notes in Computer Science 2265. Page: 220-231. Ed: Mutzel, P.; Junger, M.; Leipert, S.
18. N. Garg, V. V. Vazirani, and M. Yannakakis, Multiway Cuts in Directed and Node Weighted Graphs, In Proc. 21 st ICALP, Lecture Notes in Computer Science 820, Springer-Verlag, 1994 487-498.
19. O. Goldschmidt and D.S. Hochbaum. Polynomial algorithm for the κ-cut problem. Proc. 29th Annual Symp. on the Foundations of Computer Science (FOCS) (1988), 444-451.
20. Goldschmidt O., Hochbaum D.S. A polynomial algorithm for the κ-cut problem for fixed κ Mathematics of Operations Research. 19:1994;24-37
21. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman, San Francisco
22. T.F. Gonalez. On the computational complexity of clustering and related problems. Proc. 10th IFIP Conference on System Modeling and Optimization (1981), 174-182.
23. M. Grohe. The parameterized complexity of database queries. Proc. 20th ACM Symposium on Principles of Database Systems (PODS) (2001), 82-92.
24. Hartigan J.A. Clustering Algorithms. 1975;Wiley, New York
25. Johnson D.S., Aragon C.R., McGeoch L.A., Schevon C. Optimization by simulated annealing: an experimental evaluation; Part 1 graph partitioning. Operations Research. 37:1989;865-892
26. King V. Private communication. 1994
27. S. Khanna and R. Motwani, "Towards a Syntactic Characterization of PTAS," in: Proc. STOC 1996, ACM Press (1996), 329-337.
28. Karger D.R., Stein C. A new approach to the minimum cut problem. Journal of the ACM. 43:(4):1996;601-640
29. Karypis G., Han E.-H., Kumar V. Chameleon: Hierarchical clustering using dynamic modeling. Computer. 32:(8):August 1999;68-75
30. A. J. Quigley and P. Eades. FADE: graph drawing, clustering and visual abstraction. In Proceedings of the Eighth International Symposium on Graph Drawing, Williamsburg Virginia, USA, September 2000. Springer Verlag Lecture Notes in Computer Science 1984. Page: 197-210. Ed: Marks, J.
31. Saran H., Vazirani V.V. Finding κ cuts with in twice the optimal. SIAM Journal on Computing. 24:(1):February, 1995;101-108
32. Tao L., Zhao Y.C., Thulasiraman K, Swamy M.N.S. Simulated annealing tabu search algorithms for multiway graph partitioning. Journal of Circuits, Systems and Computers 2. 1992;159-185
33. O. Zamir and O. Etzioni. Web document clustering: a feasibility demonstration. In Proceedings of the 21st International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR'98), pages 46-54, 1998.