Skip to search formSkip to main contentSkip to account menu

Minimum k-cut

Known as: K-cut, Min k-cut 
In mathematics, the minimum k-cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations

Broader (1)

Combinatorial optimization
Gomory–Hu treeGreedy algorithmList of NP-complete problemsMaximum cut

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Faster Minimum k-cut of a Simple Graph
We consider the (exact, minimum) k-CUT problem: given a graph and an integer k, delete a minimum-weight set of edges so that the… 
2019
2019
Distributed Submodular Maximization with Bounded Communication Cost
We study distributed submodular maximization in networks with heterogeneous communication costs. In the distributed maximization… 
2018
2018
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
We consider the maximum k-cut problem that involves partitioning the vertex set of a graph into k subsets such that the sum of… 
2017
2017
A clustering-based approach for Virtual Network Function Mapping and Assigning
Network Function Virtualization has attracted attention from both academia and industry as it can help the service provider to… 
2016
2016
Weighted conflict-aware channel assignment in 802.11-based mesh networks
The hidden terminal problem, exposed terminal problem and co-channel interference problem are three main factors that limit the… 
2009
2009
Static channel assignment algorithm in multi-channel wireless mesh networks
In this paper we have considered the channel assignment problem in multi-channel multi-radio wireless mesh networks. The problem… 
2009
2009
Properties of an Approximability-related Parameter on Circular Complete Graphs
2008
2008
An optimal algorithm for tree geometrical k-cut problem
Geometrical k-cut problem has numerous applications, particularly in clustering-related setups such as task assignment and VLSI… 
Review
2008
Review
2008
Mesh Network Topology Construction and Channel Frequency Allocation in the TOWN Project
M Me es sh h N Ne et tw wo or rk k T To op po ol lo og gy y C Co on ns st tr ru uc ct ti io on n a an nd d C Ch ha an nn ne el l… 
1996
1996
On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees
This paper describes two results on graph partitioning. Our first result is a non-crossing property of minimum 3-cuts. This… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)