Generating partitions of a graph into a fixed number of minimum weight cuts

Authors:
Gerhard Reinelt;Klaus M. Wenger
Affiliations:
University of Heidelberg, Institute for Computer Science, Im Neuenheimer Feld 368, D-69120 Heidelberg, Germany;University of Heidelberg, Institute for Computer Science, Im Neuenheimer Feld 368, D-69120 Heidelberg, Germany
Venue:
Discrete Optimization
Year:
2010

Citing 20
Cited 0

Facet identification for the symmetric traveling salesman polytope

Mathematical Programming: Series A and B
An improved algorithm for the planar 3-cut problem

Journal of Algorithms
The graphical relaxation: a new framework for the Symmetric Traveling Salesman Polytope

Mathematical Programming: Series A and B
A polynomial algorithm for the k-cut problem for fixed k

Mathematics of Operations Research
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
Finding $k$ Cuts within Twice the Optimal

SIAM Journal on Computing
Implementing an efficient minimum capacity cut algorithm

Mathematical Programming: Series A and B
A new approach to the minimum cut problem

Journal of the ACM (JACM)
Rounding algorithms for a geometric embedding of minimum multiway cut

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Experimental study of minimum cut algorithms

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time

Journal of Algorithms
Fast randomized algorithms for computing minimum {3,4,5,6}-way cuts

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An improved approximation algorithm for MULTIWAY CUT

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
A simple algorithm for the planar multiway cut problem

Journal of Algorithms
On Minimum 3-Cuts and Approximating k-Cuts Using Cut Trees

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Optimal 3-Terminal Cuts and Linear Programming

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
A New Approach to Cactus Construction Applied to TSP Support Graphs

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
TSP Cuts Which Do Not Conform to the Template Paradigm

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
A new and improved algorithm for the 3-cut problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an algorithm for the generation of all partitions of a graph G with positive edge weights into k mincuts. The algorithm is an enumeration procedure based on the cactus representation of the mincuts of G. We report computational results demonstrating the efficiency of the algorithm in practice and describe in more detail a specific application for generating cuts in branch-and-cut algorithms for the traveling salesman problem.