The following pages link to (Q4228499):
Displaying 23 items.
- A 2.5-factor approximation algorithm for the \(k\)-MST problem (Q293204) (← links)
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- Algorithms for the on-line quota traveling salesman problem (Q834904) (← links)
- The online prize-collecting traveling salesman problem (Q963439) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- The bottleneck \(k\)-MST (Q1041824) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- An improved approximation ratio for the minimum latency problem (Q1290636) (← links)
- A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- An approximation algorithm for vehicle routing with compatibility constraints (Q2294242) (← links)
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem (Q2421447) (← links)
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
- Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560) (← links)
- Approximation algorithms for the covering Steiner problem (Q4537631) (← links)
- A \(2 + \varepsilon\) approximation algorithm for the \(k\)-MST problem (Q4952696) (← links)
- Service-constrained network design problems (Q5054805) (← links)
- Prize-Collecting TSP with a Budget Constraint (Q5111751) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems (Q5210996) (← links)
- A deterministic algorithm for the MST problem in constant rounds of congested clique (Q6065240) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)
- Simple heuristics for the rooted max tree coverage problem (Q6606188) (← links)
