Performance guarantees for the TSP with a parameterized triangle inequality

Authors: Bender M.A.; Chekuri C.1

Source: Information Processing Letters, Volume 73, Number 1, 31 January 2000 , pp. 17-21(5)

Publisher: Elsevier

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Keywords: Approximation algorithms; Traveling salesman problem; Relaxed triangle inequality; Algorithms

Language: English

Document Type: Short communication

DOI: 10.1016/S0020-0190(99)00160-X

Affiliations: 1: bBell Labs, 600 Mountain Avenue, Murray Hill, NJ, USA

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A