Login / Signup
Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies.
Marek Karpinski
Published in:
Electron. Colloquium Comput. Complex. (2015)
Keyphrases
</>
traveling salesman problem
global information
upper bound
real time
lower bound
data sets
error bounds
linear programming
travelling salesman
confidence bounds
tight bounds
learning theory
optimization problems
worst case
np hard
search space
multiscale
image segmentation