Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
An Efficient Practical Heuristic For Good Ratio-Cut Partitioning
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
Energy-aware variable partitioning and instruction scheduling for multibank memory architectures
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
A Practical Multi-channel Media Access Control Protocol for Wireless Sensor Networks
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
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
Algorithms for Placing Monitors in a Flow Network
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Clustering query refinements by user intent
Proceedings of the 19th international conference on World wide web
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
How to cut a graph into many pieces
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
A multiagent algorithm for graph partitioning
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
Approximating a class of classification problems
Efficient Approximation and Online Algorithms
Sum-Max graph partitioning problem
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |
The k-cut problem is to find a partition of an edge weighted graph into k nonempty components, such that the total edge weight between components is minimum. This problem is NP-complete for arbitrary k and its version involving fixing a vertex in each component is NP hard even for k=3. A polynomial algorithm for the case of a fixed k is presented.