OpenAlex
PricingAboutJobs
Log inGet started
Work

On the Approximability of TSP on Local Modifications of Optimally Solved Instances

HTML

Year: 2007
Type: article
Source: Archivio Istituzionale della Ricerca - Università degli Studi dell Aquila
Authors: H. J. Böckenhauer, FORLIZZI, LUCA, J. Hromkovic, J. Kneis, J. Kupke, PROIETTI, GUIDO, P. Widmayer
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: traveling salesman problem, local modification, approximation algorithms, optimal solution, triangle inequality, metric TSP, Christofides algorithm, NP-hardness, approximation ratio

Open Access status: closed
OpenAlex ID: W7216917469
FWCI: 0.34
Cites:
Cited by: 8
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security