English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  TSP-Based Curve Reconstruction in Polynomial Time

Althaus, E., & Mehlhorn, K. (2000). TSP-Based Curve Reconstruction in Polynomial Time. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00) (pp. 686-695). New York, USA: ACM.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Althaus, Ernst1, Author           
Mehlhorn, Kurt1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: An instance of the curve reconstruction problem is a finite sample set $V$ of an unknown curve $\gamma$. The task is to connect the points in $V$ in the order in which they lie on $\gamma$. Giesen~\cite{SCG99*207} showed recently that the Traveling Salesman tour of $V$ solves the reconstruction problem under fairly week assumptions on $\gamma$ and $V$. We extend his result along three dimensions. We weaken the assumptions, give an alternate proof, and show that in the context of curve reconstruction, the Traveling Salesman tour can be constructed in polynomial time.

Details

show
hide
Language(s): eng - English
 Dates: 2005-08-022000
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344435
Other: Local-ID: C1256428004B93B8-F4443C2749207139C12568A20039664D-AlthausMehlhorn1999
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: San Francisco, USA
Start-/End Date: 2000-01-09

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 686 - 695 Identifier: ISBN: 0-89871-453-2