Pages that link to "Item:Q4834382"
From MaRDI portal
The following pages link to A General Approximation Technique for Constrained Forest Problems (Q4834382):
Displayed 17 items.
- Cost-effective designs of fault-tolerant access networks in communication systems (Q3057095) (← links)
- Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
- Probabilistic models for the Steiner Tree problem (Q3057166) (← links)
- Clustering with Internal Connectedness (Q3078394) (← links)
- Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem (Q3088086) (← links)
- Energy-Efficient Communication in Multi-interface Wireless Networks (Q3182916) (← links)
- Primal-Dual Schema for Capacitated Covering Problems (Q3503854) (← links)
- Minimum-Weight Cycle Covers and Their Approximability (Q3508566) (← links)
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
- A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM (Q3526525) (← links)
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
- Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems (Q5505663) (← links)
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem (Q5505665) (← links)
- Upgrading bottleneck constrained forests (Q5928872) (← links)