Pages that link to "Item:Q1900190"

The following pages link to A primal-dual approximation algorithm for generalized Steiner network problems (Q1900190):

Displaying 32 items.

• A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
• An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
• Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
• A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs (Q1273087) (← links)
• An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
• Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
• LP-relaxations for tree augmentation (Q1706120) (← 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)
• Minimizing submodular functions over families of sets (Q1906848) (← links)
• A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
• Integer plane multiflow maximisation: one-quarter-approximation and gaps (Q2089777) (← links)
• Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
• Approximation of Steiner forest via the bidirected cut relaxation (Q2279758) (← links)
• An O(logn)-Competitive Algorithm for Online Constrained Forest Problems (Q3012790) (← links)
• Dimensioning multicast-enabled communications networks (Q3150132) (← links)
• Approximation Algorithms for Multi-budgeted Network Design Problems (Q3460712) (← links)
• Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
• Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920) (← links)
• (Q5002841) (← links)
• (Q5009500) (← links)
• Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation (Q5041741) (← links)
• Approximating Steiner Networks with Node Weights (Q5458547) (← links)
• Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow (Q5874526) (← links)
• Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems (Q5952066) (← 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)
• Improved approximations for relative survivable network design (Q6574948) (← links)
• Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions (Q6586662) (← links)