Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864): Difference between revisions

@@ Property / cites work @@
+Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for b-matchings: An alternative approach
+Normal rank
@@ Property / cites work @@
+Additive Guarantees for Degree-Bounded Directed Network Design
+Normal rank
@@ Property / cites work @@
+``Integer-making'' theorems
@@ Property / cites work: ``Integer-making'' theorems / rank @@
+Normal rank
@@ Property / cites work @@
+A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
+Normal rank
@@ Property / cites work @@
+\(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
@@ Property / cites work: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts / rank @@
+Normal rank
@@ Property / cites work @@
+On Column-Restricted and Priority Covering Integer Programs
+Normal rank
@@ Property / cites work @@
+Q5743501
@@ Property / cites work: Q5743501 / rank @@
+Normal rank
@@ Property / cites work @@
+Multicommodity demand flow in a tree and packing integer programs
+Normal rank
@@ Property / cites work @@
+Q4938792
@@ Property / cites work: Q4938792 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of approximating bounded variants of optimization problems
+Normal rank
@@ Property / cites work @@
+Q5675543
@@ Property / cites work: Q5675543 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
+Normal rank
@@ Property / cites work @@
+Conversion of coloring algorithms into maximum weight independent set algorithms
+Normal rank
@@ Property / cites work @@
+Path problems in generalized stars, complete graphs, and brick wall graphs
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Iterated Rounding Algorithms for the Smallest <i>k</i>-Edge Connected Spanning Subgraph
+Normal rank
@@ Property / cites work @@
+Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding
+Normal rank
@@ Property / cites work @@
+Primal-dual approximation algorithms for integral flow and multicut in trees
+Normal rank
@@ Property / cites work @@
+Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
+Normal rank
@@ Property / cites work @@
+A factor 2 approximation algorithm for the generalized Steiner network problem
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum common subgraph problem
+Normal rank
@@ Property / cites work @@
+Global wire routing in two-dimensional arrays
@@ Property / cites work: Global wire routing in two-dimensional arrays / rank @@
+Normal rank
@@ Property / cites work @@
+Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
+Normal rank
@@ Property / cites work @@
+Survivable Network Design with Degree or Order Constraints
+Normal rank
@@ Property / cites work @@
+Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
+Normal rank
@@ Property / cites work @@
+On the disjoint paths problem
@@ Property / cites work: On the disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative Packing for Demand and Hypergraph Matching
+Normal rank
@@ Property / cites work @@
+Throughput Maximization for Periodic Packet Routing on Trees and Grids
+Normal rank
@@ Property / cites work @@
+k-Edge-Connectivity: Approximation and LP Relaxation
+Normal rank
@@ Property / cites work @@
+Approximability of sparse integer programs
@@ Property / cites work: Approximability of sparse integer programs / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+The Demand-Matching Problem
@@ Property / cites work: The Demand-Matching Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating minimum bounded degree spanning trees to within one of optimal
+Normal rank