Fast and Deterministic Approximations for k-Cut. (Q5875475): Difference between revisions

@@ Property / cites work @@
+On the \(k\)-cut problem
@@ Property / cites work: On the \(k\)-cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4952606
@@ Property / cites work: Q4952606 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of capacitated network design
@@ Property / cites work: Approximability of capacitated network design / rank @@
+Normal rank
@@ Property / cites work @@
+The Steiner k-Cut Problem
@@ Property / cites work: The Steiner k-Cut Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Linear Time Approximation Schemes for some Implicit Fractional Packing Problems
+Normal rank
@@ Property / cites work @@
+Q4607903
@@ Property / cites work: Q4607903 / rank @@
+Normal rank
@@ Property / cites work @@
+On Approximating (Sparse) Covering Integer Programs
+Normal rank
@@ Property / cites work @@
+Designing FPT Algorithms for Cut Problems Using Randomized Contractions
+Normal rank
@@ Property / cites work @@
+Q2843923
@@ Property / cites work: Q2843923 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
+Normal rank
@@ Property / cites work @@
+A General Approximation Technique for Constrained Forest Problems
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond the flow decomposition barrier
@@ Property / cites work: Beyond the flow decomposition barrier / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for the k-cut Problem for Fixed k
+Normal rank
@@ Property / cites work @@
+Q4608074
@@ Property / cites work: Q4608074 / rank @@
+Normal rank
@@ Property / cites work @@
+The number of minimum             <i>k</i>             -cuts: improving the Karger-Stein bound
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Finding Nearest Common Ancestors
+Normal rank
@@ Property / cites work @@
+Local Flow Partitioning for Faster Edge Connectivity
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+Random sampling in cut, flow, and network design problems
+Normal rank
@@ Property / cites work @@
+Minimum cuts in near-linear time
@@ Property / cites work: Minimum cuts in near-linear time / rank @@
+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 @@
+The Minimum k-way Cut of Bounded Size is Fixed-Parameter Tractable
+Normal rank
@@ Property / cites work @@
+Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for covering/packing integer programs
+Normal rank
@@ Property / cites work @@
+Q4952694
@@ Property / cites work: Q4952694 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis
+Normal rank
@@ Property / cites work @@
+Q3140458
@@ Property / cites work: Q3140458 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
+Normal rank
@@ Property / cites work @@
+Minimum cost subpartitions in graphs
@@ Property / cites work: Minimum cost subpartitions in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768268
@@ Property / cites work: Q2768268 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating \(k\)-cuts using network strength as a Lagrangean relaxation
+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 @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+A simple min-cut algorithm
@@ Property / cites work: A simple min-cut algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549696
@@ Property / cites work: Q3549696 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
+Normal rank