Generating partitions of a graph into a fixed number of minimum weight cuts
type: Item
instance of: scholarly article
title: Generating partitions of a graph into a fixed number of minimum weight cuts
zbMATH Open document ID: 1264.05107
author: Klaus M. Wenger
author: Gerhard Reinelt
published in: Discrete Optimization
publication date: 2013-05-31T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6168916
zbMATH Keywords: mincut
zbMATH Keywords: graph partitioning
zbMATH Keywords: cactus
zbMATH Keywords: traveling salesman problem
describes a project that uses: PORTA
describes a project that uses: Concorde
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.disopt.2009.07.001
OpenAlex ID: W2038523985
cites work: Q5501810
cites work: Practical performance of efficient minimum cut algorithms
cites work: A new approach to the minimum cut problem
cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k
cites work: Finding k Cuts within Twice the Optimal
cites work: On minimum 3-cuts and approximating k-cuts using Cut Trees
cites work: Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
cites work: An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
cites work: An improved algorithm for the planar 3-cut problem
cites work: A new and improved algorithm for the 3-cut problem
cites work: A fast algorithm for computing minimum 3-way and 4-way cuts
cites work: A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
cites work: Q4952694
cites work: A divide-and-conquer approach to the minimum \(k\)-way cut problem.
cites work: The Complexity of Multiterminal Cuts
cites work: A simple algorithm for the planar multiway cut problem
cites work: An improved approximation algorithm of MULTIWAY CUT.
cites work: Rounding algorithms for a geometric embedding of minimum multiway cut
cites work: Q4263706
cites work: Q4037426
cites work: Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
cites work: A fast algorithm for cactus representations of minimum cuts
cites work: Canonical cactus representation for miminum cuts
cites work: Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
cites work: Q4737522
cites work: Implementing an efficient minimum capacity cut algorithm
cites work: Q3425132
cites work: Facet identification for the symmetric traveling salesman polytope
cites work: Q4667108
cites work: Q3159359
cites work: Q4735941
cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
cites work: The graphical relaxation: A new framework for the symmetric traveling salesman polytope
cites work: Combinatorial optimization and small polytopes
DOI: 10.1016/J.DISOPT.2009.07.001
description: scientific article; zbMATH DE number 6168916