Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211): Difference between revisions

@@ Property / author @@
-Zeev Nutov
@@ Property / author: Zeev Nutov / rank @@
-Normal rank
@@ Property / author @@
+Zeev Nutov
@@ Property / author: Zeev Nutov / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3578
@@ Property / arXiv ID: 1203.3578 / rank @@
+Normal rank
@@ Property / cites work @@
+A bad example for the iterative rounding method for mincost \(k\)-connected spanning subgraphs
+Normal rank
@@ Property / cites work @@
+A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
+Normal rank
@@ Property / cites work @@
+On generalizations of network design problems with degree bounds
+Normal rank
@@ Property / cites work @@
+Additive Guarantees for Degree-Bounded Directed Network Design
+Normal rank
@@ Property / cites work @@
+An Approximation Algorithm for the Minimum-Cost <i>k</i>-Vertex Connected Subgraph
+Normal rank
@@ Property / cites work @@
+Network design via iterative rounding of setpair relaxations
+Normal rank
@@ Property / cites work @@
+Approximating Minimum-Cost $k$-Node Connected Subgraphs via Independence-Free Graphs
+Normal rank
@@ Property / cites work @@
+Q2913818
@@ Property / cites work: Q2913818 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements
+Normal rank
@@ Property / cites work @@
+An $O(\log^2{k})$-Approximation Algorithm for the $k$-Vertex Connected Spanning Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
+Normal rank
@@ Property / cites work @@
+Minimal edge-coverings of pairs of sets
@@ Property / cites work: Minimal edge-coverings of pairs of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Rooted \(k\)-connections in digraphs
@@ Property / cites work: Rooted \(k\)-connections in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3085455
@@ Property / cites work: Q3085455 / rank @@
+Normal rank
@@ Property / cites work @@
+An application of submodular flows
@@ Property / cites work: An application of submodular flows / rank @@
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+Independence free graphs and vertex connectivity augmentation
+Normal rank
@@ Property / cites work @@
+Approximating node connectivity problems via set covers
+Normal rank
@@ Property / cites work @@
+Approximating <i>k</i>-node Connected Subgraphs via Critical Graphs
+Normal rank
@@ Property / cites work @@
+Network-Design with Degree Constraints
@@ Property / cites work: Network-Design with Degree Constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Degree bounded matroids and submodular flows
@@ Property / cites work: Degree bounded matroids and submodular flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753740
@@ Property / cites work: Q2753740 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Uniform Connectivity Problems
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
+Normal rank
@@ Property / cites work @@
+Survivable Network Design with Degree or Order Constraints
+Normal rank
@@ Property / cites work @@
+Iterative Methods in Combinatorial Optimization
@@ Property / cites work: Iterative Methods in Combinatorial Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Additive Approximation for Bounded Degree Survivable Network Design
+Normal rank
@@ Property / cites work @@
+A Unified Algorithm for Degree Bounded Survivable Network Design
+Normal rank
@@ Property / cites work @@
+Improved Algorithm for Degree Bounded Survivable Network Design Problem
+Normal rank
@@ Property / cites work @@
+Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
+Normal rank
@@ Property / cites work @@
+Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
+Normal rank
@@ Property / cites work @@
+Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
+Normal rank
@@ Property / cites work @@
+Approximating minimum-cost edge-covers of crossing biset-families
+Normal rank
@@ Property / cites work @@
+Approximating minimum-cost connectivity problems via uncrossable bifamilies
+Normal rank
@@ Property / cites work @@
+Approximating subset \(k\)-connectivity problems
@@ Property / cites work: Approximating subset \(k\)-connectivity problems / rank @@
+Normal rank
@@ Property / cites work @@
+Degree constrained node-connectivity problems
@@ Property / cites work: Degree constrained node-connectivity problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2949211