Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501): Difference between revisions

@@ Property / author @@
-Gerhard Reinelt
@@ Property / author: Gerhard Reinelt / rank @@
-Normal rank
@@ Property / author @@
+Gerhard Reinelt
@@ Property / author: Gerhard Reinelt / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+PORTA
@@ Property / describes a project that uses: PORTA / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Concorde
@@ Property / describes a project that uses: Concorde / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+TSPLIB
@@ Property / describes a project that uses: TSPLIB / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2009.07.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2038523985
@@ Property / OpenAlex ID: W2038523985 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501810
@@ Property / cites work: Q5501810 / rank @@
+Normal rank
@@ Property / cites work @@
+Practical performance of efficient minimum cut algorithms
+Normal rank
@@ Property / cites work @@
+A new approach to the minimum cut problem
@@ Property / cites work: A new approach to the minimum cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for the k-cut Problem for Fixed k
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Cuts within Twice the Optimal
@@ Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank @@
+Normal rank
@@ Property / cites work @@
+On minimum 3-cuts and approximating k-cuts using Cut Trees
+Normal rank
@@ Property / cites work @@
+Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
+Normal rank
@@ Property / cites work @@
+An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the planar 3-cut problem
+Normal rank
@@ Property / cites work @@
+A new and improved algorithm for the 3-cut problem
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing minimum 3-way and 4-way cuts
+Normal rank
@@ Property / cites work @@
+A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
+Normal rank
@@ Property / cites work @@
+Q4952694
@@ Property / cites work: Q4952694 / rank @@
+Normal rank
@@ Property / cites work @@
+A divide-and-conquer approach to the minimum \(k\)-way cut problem.
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Algorithm for the Planar Multiway Cut Problem
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm of MULTIWAY CUT.
+Normal rank
@@ Property / cites work @@
+Rounding algorithms for a geometric embedding of minimum multiway cut
+Normal rank
@@ Property / cites work @@
+Q4263706
@@ Property / cites work: Q4263706 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037426
@@ Property / cites work: Q4037426 / rank @@
+Normal rank
@@ Property / cites work @@
+Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
+Normal rank
@@ Property / cites work @@
+A fast algorithm for cactus representations of minimum cuts
+Normal rank
@@ Property / cites work @@
+Canonical cactus representation for miminum cuts
@@ Property / cites work: Canonical cactus representation for miminum cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
+Normal rank
@@ Property / cites work @@
+Q4737522
@@ Property / cites work: Q4737522 / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing an efficient minimum capacity cut algorithm
+Normal rank
@@ Property / cites work @@
+Q3425132
@@ Property / cites work: Q3425132 / rank @@
+Normal rank
@@ Property / cites work @@
+Facet identification for the symmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+Q4667108
@@ Property / cites work: Q4667108 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3159359
@@ Property / cites work: Q3159359 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4735941
@@ Property / cites work: Q4735941 / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
+Normal rank
@@ Property / cites work @@
+The graphical relaxation: A new framework for the symmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization and small polytopes
@@ Property / cites work: Combinatorial optimization and small polytopes / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1952501