Pages that link to "Item:Q4834382"
From MaRDI portal
The following pages link to A General Approximation Technique for Constrained Forest Problems (Q4834382):
Displayed 50 items.
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Graph coloring with rejection (Q632809) (← links)
- Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- A better approximation algorithm for the budget prize collecting tree problem. (Q703233) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
- Using fractional primal-dual to schedule split intervals with demands (Q865744) (← links)
- New primal-dual algorithms for Steiner tree problems (Q868154) (← links)
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
- An approximation algorithm for network design problems with downwards-monotone demand functions (Q928296) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- Elementary approximation algorithms for prize collecting Steiner tree problems (Q963393) (← links)
- The online prize-collecting traveling salesman problem (Q963439) (← links)
- The Steiner forest problem revisited (Q972355) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- An approximation algorithm to the \(k\)-Steiner forest problem (Q1007251) (← links)
- Approximation algorithms for connected facility location problems (Q1016041) (← links)
- Non-cooperative tree creation (Q1017908) (← links)
- Path hitting in acyclic graphs (Q1018049) (← links)
- Approximation algorithms for soft-capacitated facility location in capacitated network design (Q1024778) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem (Q1041431) (← links)
- Approximation algorithms for minimum tree partition (Q1270776) (← links)
- An efficient approximation algorithm for the survivable network design problem (Q1290632) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- Recent results on approximating the Steiner tree problem and its generalizations (Q1566960) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Improved methods for approximating node weighted Steiner trees and connected dominating sets. (Q1854264) (← links)
- A primal-dual approximation algorithm for the survivable network design problem in hypergraphs (Q1861578) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- Minimizing submodular functions over families of sets (Q1906848) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- A primal-dual approximation algorithm for the asymmetric prize-collecting TSP (Q1944387) (← links)
- Energy-efficient communication in multi-interface wireless networks (Q1946498) (← links)
- Connected facility location via random facility sampling and core detouring (Q1959419) (← links)
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem (Q2379971) (← links)
- A survey of combinatorial optimization problems in multicast routing (Q2387246) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- Euclidean prize-collecting Steiner forest (Q2429324) (← links)
- Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)