Work

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

Year: 1997

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-63248-4_5

Author: Sanjeev Arora

Institution: Princeton University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2171554063

FWCI: 13.3

Cites: 19

Cited by: 136

Related to: 10