Approximating the smallest k -edge connected spanning subgraph by LP-rounding (Q3057092): Difference between revisions

@@ Property / cites work @@
+Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem on a graph and some related integer polyhedra
+Normal rank
@@ Property / cites work @@
+A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Submodular functions in graph theory
@@ Property / cites work: Submodular functions in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501264
@@ Property / cites work: Q5501264 / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Analysis for Approximating the Smallest <i>k</i>-Edge Connected Spanning Subgraph of a Multigraph
+Normal rank
@@ Property / cites work @@
+On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Random Sampling in Cut, Flow, and Network Design Problems
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Uniform Connectivity Problems
+Normal rank
@@ Property / cites work @@
+Approximating the Minimum Equivalent Digraph
@@ Property / cites work: Approximating the Minimum Equivalent Digraph / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for a network design problem with crossing supermodular demands
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank

Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092): Difference between revisions

Latest revision as of 12:57, 3 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)