Pages that link to "Item:Q4834382"
From MaRDI portal
The following pages link to A General Approximation Technique for Constrained Forest Problems (Q4834382):
Displaying 50 items.
- On fixed cost \(k\)-flow problems (Q260248) (← links)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique (Q278736) (← links)
- A 2.5-factor approximation algorithm for the \(k\)-MST problem (Q293204) (← links)
- A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem (Q315496) (← links)
- Network repair crew scheduling and routing for emergency relief distribution problem (Q320672) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- An approximation algorithm for the generalized \(k\)-multicut problem (Q423940) (← links)
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- Approximating \(k\)-generalized connectivity via collapsing HSTs (Q491201) (← 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)
- The A priori traveling repairman problem (Q722527) (← links)
- Clustering with lower-bounded sizes. A general graph-theoretic framework (Q722539) (← links)
- Primal-dual schema for capacitated covering problems (Q747765) (← 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)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- Dynamic algorithms via the primal-dual method (Q1640995) (← links)
