The following pages link to (Q3128880):
Displayed 50 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- Incremental network design with shortest paths (Q296857) (← links)
- GMPLS label space minimization through hypergraph layouts (Q442249) (← links)
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
- Fractional routing using pairs of failure-disjoint paths (Q496701) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- Approximating source location and star survivable network problems (Q528470) (← 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)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- Online constrained forest and prize-collecting network design (Q1755747) (← 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)
- Fast distributed approximation for TAP and 2-edge-connectivity (Q1988524) (← links)
- A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
- Socially fair network design via iterative rounding (Q2084030) (← links)
- Approximation algorithms for vertex-connectivity augmentation on the cycle (Q2085731) (← links)
- Flexible graph connectivity (Q2118137) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Approximation of Steiner forest via the bidirected cut relaxation (Q2279758) (← links)
- Approximability of capacitated network design (Q2354026) (← 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)
- On the tree augmentation problem (Q2659770) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← 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)
- Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
- Designing Hypergraph Layouts to GMPLS Routing Strategies (Q3408160) (← links)
- Approximation algorithm for the group Steiner network problem (Q3428914) (← links)
- Approximation Algorithms for Multi-budgeted Network Design Problems (Q3460712) (← links)