The following pages link to (Q3128880):
Displayed 33 items.
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- Linear bounds for on-line Steiner problems (Q672394) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- Algorithms for a multi-level network optimization problem (Q1307817) (← links)
- The parsimonious property of cut covering problems and its applications (Q1375118) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- Approximating covering integer programs with multiplicity constraints (Q1406040) (← links)
- Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Approximating minimum size \{1,2\}-connected networks (Q1861563) (← links)
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578) (← links)
- A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190) (← links)
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
- An automated network generation procedure for routing of unmanned aerial vehicles (UAVs) in a GIS environment (Q2642500) (← links)
- 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)
- Designing Hypergraph Layouts to GMPLS Routing Strategies (Q3408160) (← links)
- Approximation algorithm for the group Steiner network problem (Q3428914) (← links)
- Connectivity-splitting models for survivable network design (Q4446914) (← links)
- Algorithms for a network design problem with crossing supermodular demands (Q4474300) (← links)
- Design of Survivable Networks: A survey (Q5318274) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
- Upgrading bottleneck constrained forests (Q5928872) (← links)
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← links)