Pages that link to "Item:Q873648"

The following pages link to A factor 2 approximation algorithm for the generalized Steiner network problem (Q873648):

Displaying 50 items.

• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
• Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← 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)
• Improved approximation for fractionally subadditive network design (Q2011025) (← links)
• A simple primal-dual approximation algorithm for 2-edge-connected spanning subgraphs (Q2019478) (← links)
• Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
• The minimum degree group Steiner problem (Q2065790) (← links)
• Socially fair network design via iterative rounding (Q2084030) (← links)
• Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem (Q2102838) (← links)
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs (Q2117101) (← links)
• Flexible graph connectivity (Q2118137) (← links)
• A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
• Group parking permit problems (Q2184679) (← links)
• The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
• Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
• Stronger MIP formulations for the Steiner forest problem (Q2227541) (← links)
• On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
• A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
• A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
• Approximability of capacitated network design (Q2354026) (← links)
• Task assignment in tree-like hierarchical structures (Q2410113) (← links)
• On generalizations of the parking permit problem and network leasing problems (Q2413177) (← links)
• Pruning 2-connected graphs (Q2428662) (← links)
• Approximating node-connectivity augmentation problems (Q2429349) (← links)
• Approximating minimum cost source location problems with local vertex-connectivity demands (Q2434929) (← links)
• Degree bounded matroids and submodular flows (Q2448960) (← links)
• Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
• Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
• Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
• On the tree augmentation problem (Q2659770) (← links)
• On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
• Approximating the generalized terminal backup problem via half-integral multiflow relaxation (Q2804546) (← links)
• Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
• Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
• The Generalized Terminal Backup Problem (Q2947440) (← links)
• Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
• An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints (Q2958349) (← links)
• Approximability of Capacitated Network Design (Q3009752) (← links)
• Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
• Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (Q3010423) (← links)
• An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity (Q3012788) (← links)
• Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
• Network flow spanners (Q3057178) (← links)
• Approximating Survivable Networks with Minimum Number of Steiner Points (Q3075458) (← links)
• A (1 + ln 2)-Approximation Algorithm for Minimum-Cost 2-Edge-Connectivity Augmentation of Trees with Constant Radius (Q3088090) (← links)
• Network-Design with Degree Constraints (Q3088102) (← links)
• Fast Distributed Approximation for TAP and 2-Edge-Connectivity (Q3300822) (← links)
• From Cost Sharing Mechanisms to Online Selection Problems (Q3449447) (← links)