September 01, 1998 article Open access Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems Journal of the ACM DOI: 10.1145/290179.290180 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 5 stored of 1,149 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Improved Approximation Algorithms for the Expanding Search Problem 2026 SIAM Journal on Discrete Mathematics article Computer Science Complexity and Algorithms in Graphs 0 citations Planar Multiway Cut with Terminals on Few Faces 2025 ACM Transactions on Algorithms article Computer Science Advanced Graph Theory Research 0 citations Challenges and opportunities in quantum optimization 2024 Nature Reviews Physics review Computer Science Quantum Computing Algorithms and Architecture Open access 185 citations Quantum Optimization: Potential, Challenges, and the Path Forward 2023 report Computer Science Quantum Computing Algorithms and Architecture Open access 60 citations Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP 2023 Warwick Research Archive Portal (University of Warwick) article Computer Science Complexity and Algorithms in Graphs Open access 33 citations 5 results References 0