Traveling Salesman-Based Curve Reconstruction in Polynomial Time

DOI10.1137/S0097539700366115zbMath0992.68070OpenAlexW2157134394MaRDI QIDQ2719129

Kurt Mehlhorn, Ernst Althaus

Publication date: 21 June 2001

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539700366115

zbMATH Keywords

traveling salesmanpolynomial timecurve reconstruction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Detecting and approximating decision boundaries in low-dimensional spaces ⋮ Curve reconstruction from noisy samples ⋮ Intelligent Solutions for Curve Reconstruction Problem

This page was built for publication: Traveling Salesman-Based Curve Reconstruction in Polynomial Time