Work

A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP

Year: 1997

Type: article

Authors: Sanjeev Arora, Michelangelo Grigni, David Karger, Philip Kleins, Andrzej Woloszyn

Institutions: Princeton University, Emory University, Massachusetts Institute of Technology, Brown 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: W2062254875

FWCI: 3.545

Cites: 11

Cited by: 136

Related to: 10