Simplicity and hardness of the maximum traveling salesman problem under geometric distances

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 337-345

  Fekete, Sandor P ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; GRAPH THEORY;

MAXIMUM SCATTER TRAVELING SALESMAN PROBLEM;

TRAVELING SALESMAN PROBLEM;

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

References (17)