New answers tagged approximation-algorithms
0
votes
Stable/Robust Traveling Salesman Approximation Methods
This, technically, answers the question as posted and is a bit large for a comment, so here it is.
Compute any $c$-approximate TSP solution $P$ for $G$.
Assume WLOG by renaming that $P=(x_1, x_2, \...
Top 50 recent answers are included
Related Tags
approximation-algorithms × 513ds.algorithms × 163
approximation-hardness × 90
graph-theory × 80
graph-algorithms × 80
cc.complexity-theory × 78
reference-request × 67
optimization × 61
np-hardness × 48
linear-programming × 29
randomized-algorithms × 24
set-cover × 24
co.combinatorics × 23
clustering × 21
approximation × 19
packing × 17
partition-problem × 15
machine-learning × 14
max-cut × 14
counting-complexity × 13
submodularity × 13
cg.comp-geom × 10
linear-algebra × 10
online-algorithms × 10
complexity-classes × 9