Pages that link to "Item:Q873648"
From MaRDI portal
The following pages link to A factor 2 approximation algorithm for the generalized Steiner network problem (Q873648):
Displaying 50 items.
- Approximation Algorithms for Multi-budgeted Network Design Problems (Q3460712) (← links)
- Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) (← links)
- A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem (Q3541797) (← links)
- Approximating Directed Weighted-Degree Constrained Networks (Q3541798) (← links)
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- (Q3758867) (← links)
- Approximating Minimum Cost Connectivity Orientation and Augmentation (Q4606698) (← links)
- ON THE VERTEX-CONNECTIVITY PROBLEM FOR GRAPHS WITH SHARPENED TRIANGLE INEQUALITY (Q4667918) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- A Local-Search Algorithm for Steiner Forest (Q4993295) (← links)
- A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
- On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)
- (Q5002841) (← links)
- (Q5009500) (← links)
- An Exact Algorithm for the Steiner Forest Problem (Q5009640) (← links)
- Bounded Degree Group Steiner Tree Problems (Q5041204) (← links)
- Flexible Graph Connectivity (Q5041731) (← links)
- Improved Approximation Algorithms for Inventory Problems (Q5041737) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- On the Complexity of Local Graph Transformations (Q5092357) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- (Q5111735) (← links)
- (Q5111750) (← links)
- A note on iterated rounding for the survivable network design problem (Q5240415) (← links)
- Facility Location with Matroid or Knapsack Constraints (Q5252229) (← links)
- Approximating Scheduling Machines with Capacity Constraints (Q5321720) (← links)
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph (Q5346544) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location (Q5459999) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
- (Q5743405) (← links)
- (Q5743446) (← links)
- (Q5743494) (← links)
- (Q5743495) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow (Q5874526) (← links)
- An Improved Approximation Algorithm for the Matching Augmentation Problem (Q5883280) (← links)
- Node-Connectivity Terminal Backup, Separately Capacitated Multiflow, and Discrete Convexity (Q5883291) (← links)
- A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs (Q5900474) (← links)
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach (Q5919564) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
- Node connectivity augmentation via iterative randomized rounding (Q6038664) (← links)
- Correlation clustering and two-edge-connected augmentation for planar graphs (Q6046943) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- On the complexity of the bilevel minimum spanning tree problem (Q6064168) (← links)
