The following pages link to (Q4234074):
Displaying 15 items.
- Robust optimization for routing problems on trees (Q301384) (← links)
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- \(k\)-edge subgraph problems (Q1356515) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- Compact location problems (Q1391322) (← links)
- The computational complexity of the \(k\)-minimum spanning tree problem in graded matrices (Q1806599) (← links)
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
- Approximation algorithms for time-dependent orienteering. (Q1853044) (← links)
- Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
