Name
Abstract | ||
|---|---|---|
We consider constrained versions of the prize-collecting traveling salesman and the minimum spanning tree problems. The goal is to maximize the number of vertices in the returned tour/tree subject to a bound on the tour/tree cost. We present a 2-approximation algorithm for these problems based on a primal-dual approach. The algorithm relies on finding a threshold value for the dual variable corresponding to the budget constraint in the primal and then carefully constructing a tour/tree that is just within budget. Thereby, we improve the best-known guarantees from 3+epsilon and 2+epsilon for the tree and the tour version, respectively. Our analysis extends to the setting with weighted vertices, in which we want to maximize the total weight of vertices in the tour/tree subject to the same budget constraint. |
Year | Venue | Field |
|---|---|---|
2017 | ESA | Discrete mathematics,Combinatorics,Budget constraint,Vertex (geometry),k-minimum spanning tree,Travelling salesman problem,Spanning tree,Mathematics,Minimum spanning tree |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alice Paul | 1 | 0 | 0.68 |
| Daniel Freund | 2 | 23 | 5.58 |
| Aaron Ferber | 3 | 4 | 0.75 |
| David B. Shmoys | 4 | 4829 | 601.03 |
| David P. Williamson | 5 | 3564 | 413.34 |