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
Polynomial algorithm for the k-cut problem
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
An optimal algorithm for general array geometrical k-cut problem
MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Hi-index | 0.00 |
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 tree 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.