Reducing Curse of Dimensionality

DOI10.1145/3158232zbMath1452.68274OpenAlexW2781784381MaRDI QIDQ4554955

Shaofeng H.-C. Jiang, T.-H. Hubert Chan

Publication date: 12 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3158232

zbMATH Keywords

metric spaceapproximation schemedoubling dimensiontraveling salesman problem with neighborhoods

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM

This page was built for publication: Reducing Curse of Dimensionality