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.
- Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem (Q324874) (← links)
- Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705) (← links)
- On some network design problems with degree constraints (Q355516) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
- A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius (Q388116) (← links)
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- Degree constrained node-connectivity problems (Q486998) (← 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)
- Approximating source location and star survivable network problems (Q528470) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Matching interdiction (Q602686) (← links)
- Approximating directed weighted-degree constrained networks (Q627195) (← links)
- Price of stability in survivable network design (Q647493) (← links)
- Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- Approximating fault-tolerant group-Steiner problems (Q764316) (← links)
- On the maximum size of a minimal \(k\)-edge connected augmentation (Q765200) (← links)
- Network design with edge-connectivity and degree constraints (Q839639) (← links)
- LP-based solution methods for the asymmetric TSP (Q845937) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- On the \(L_{\infty}\)-norm of extreme points for crossing supermodular directed network LPs (Q877196) (← links)
- A unified algorithm for degree bounded survivable network design (Q896300) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- Improved approximation algorithm for the feedback set problem in a bipartite tournament (Q957363) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- Covering a laminar family by leaf to leaf links (Q987693) (← links)
- A note on Rooted Survivable Networks (Q990935) (← links)
- On the integrality ratio for tree augmentation (Q1003482) (← links)
- Minimizing the stabbing number of matchings, trees, and triangulations (Q1006396) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Inapproximability of survivable networks (Q1019191) (← links)
- Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Multiple facility location on a network with linear reliability order of edges (Q1680498) (← links)
- Chain-constrained spanning trees (Q1702777) (← links)
- LP-relaxations for tree augmentation (Q1706120) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. I: Stemless TAP (Q1709580) (← links)
- Approximating (unweighted) tree augmentation via lift-and-project. II (Q1709583) (← links)
- Black-box reductions for cost-sharing mechanism design (Q1735730) (← links)
- On matrices with the Edmonds-Johnson property arising from bidirected graphs (Q1745732) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- On survivable network polyhedra (Q1772416) (← links)
