Polynomial time approximation schemes for Euclidean TSP and other geometric problems

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1996, Pages 2-11

  Arora, Sanjeev ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

EUCLIDEAN PROBLEMS; POLYNOMIAL TIME APPROXIMATION SCHEME; TRAVELING SALESMAN PROBLEM;

APPROXIMATION THEORY;

EID: 0030413554     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (42)