The following pages link to (Q4952696):
Displaying 13 items.
- On the approximability of dense Steiner problems (Q396661) (← links)
- A better approximation algorithm for the budget prize collecting tree problem. (Q703233) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
- Computing small partial coverings (Q1007552) (← links)
- Subexponential algorithms for partial cover problems (Q1944141) (← links)
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
- Honey-pot constrained searching with local sensory information (Q2507866) (← links)
- Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)
- Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
