The following pages link to (Q3128880):
Displaying 33 items.
- Approximability of Capacitated Network Design (Q3009752) (← links)
- An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
- An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (Q3012790) (← links)
- Network flow spanners (Q3057178) (← links)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- Designing Hypergraph Layouts to GMPLS Routing Strategies (Q3408160) (← links)
- Acceleration of cutting-plane and column generation algorithms: Applications to network design (Q3418117) (← links)
- Approximation algorithm for the group Steiner network problem (Q3428914) (← links)
- Approximation Algorithms for Multi-budgeted Network Design Problems (Q3460712) (← links)
- Connectivity-splitting models for survivable network design (Q4446914) (← links)
- Algorithms for a network design problem with crossing supermodular demands (Q4474300) (← links)
- AN EFFICIENT COMPLETE ENUMERATION METHOD FOR NETWORK DESIGN PROBLEMS AND ITS APPLICATIONS (Q4797035) (← links)
- (Q5002841) (← links)
- Flexible Graph Connectivity (Q5041731) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- On the approximability of some maximum spanning tree problems (Q5096340) (← links)
- (Q5111750) (← links)
- A note on iterated rounding for the survivable network design problem (Q5240415) (← links)
- Design of Survivable Networks: A survey (Q5318274) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
- Upgrading bottleneck constrained forests (Q5928872) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← 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)
- Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
- Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree (Q6156028) (← links)
- Modifying networks to obtain low cost trees (Q6550552) (← links)
- Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions (Q6586662) (← links)
- Better-than-\(\frac{4}{3}\)-approximations for leaf-to-leaf tree and connectivity augmentation (Q6608041) (← links)
