An optimal algorithm for general array geometrical k-cut problem

Authors:
Sang-Young Cho
Affiliations:
Hankuk University of Foreign Studies, Computer Science and Engineering Department, Yongin, Kyeonggi, Korea
Venue:
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Year:
2009

Citing 6
Cited 0

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Combinatorial Algorithms

Combinatorial Algorithms
Geometrical k-cut problem and an optimal solution for hypercubes

MATH'07 Proceedings of the 12th WSEAS International Conference on Applied Mathematics
Polynomial algorithm for the k-cut problem

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
An optimal algorithm for tree geometrical k-cut problem

MACMESE'08 Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Geometrical k-cut problem has numerous applications, particularly in clustering-related setups such as task assignment and VLSI cell placement. This problem is NP-hard in general. We propose an optimal algorithm to solve the problem for general array topology graphs in polynomial time. The time complexity of the algorithm is O(kn3), where n is the number of nodes in a k-terminal graph, with the Goldberg-Tarjan's network flow algorithm.