On the k-cut problem

Authors:
Francisco Barahona
Affiliations:
IBM T.J. Watson Research Center, P.O. 218, Yorktown Heights, NY 10598, USA
Venue:
Operations Research Letters
Year:
2000

Citing 11
Cited 2

Optimal attack and reinforcement of a network

Journal of the ACM (JACM)
Finding k-cuts within twice the optimal

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A faster algorithm for computing the strength of a network

Information Processing Letters
A polynomial algorithm for the k-cut problem for fixed k

Mathematics of Operations Research
A new approach to the minimum cut problem

Journal of the ACM (JACM)
Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach

Journal of Algorithms
An $\NC$ Algorithm for Minimum Cuts

SIAM Journal on Computing
A combinatorial algorithm for minimizing symmetric submodular functions

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Network Design Using Cut Inequalities

SIAM Journal on Optimization
On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Separating from the dominant of the spanning tree polytope

Operations Research Letters

Bidirected and unidirected capacity installation in telecommunication networks

Discrete Applied Mathematics - International symposium on combinatorial optimisation
Algorithms for the non-bifurcated network design problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a graph with nonnegative edge-weights, let f(k) be the value of an optimal solution of the k-cut problem. We study f as a function of k. Let g be the convex envelope of f. We give a polynomial algorithm to compute g. In particular, if f is convex, then it can be computed in polynomial time for all k. We show some experiments in computing g.