Skip to main content
SpringerLink
Log in

Nearly linear time approximation schemes for Euclidean TSP and other geometric problems

  • Invited Talk
  • Conference paper
  • First Online:
Randomization and Approximation Techniques in Computer Science (RANDOM 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1269))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Author information

Authors and Affiliations

  1. Princeton University, USA

    Sanjeev Arora

Authors
  1. Sanjeev Arora
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arora, S. (1997). Nearly linear time approximation schemes for Euclidean TSP and other geometric problems. In: Rolim, J. (eds) Randomization and Approximation Techniques in Computer Science. RANDOM 1997. Lecture Notes in Computer Science, vol 1269. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63248-4_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-63248-4_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63248-1

  • Online ISBN: 978-3-540-69247-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation