Work

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

Year: 1998

Type: book-chapter

Source: DIMACS series in discrete mathematics and theoretical computer science

DOI: 10.1090/dimacs/040/01

Author: Sanjeev Arora

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: W4231303540

FWCI: 1.929

Cites:

Cited by: 9

Related to: 10