An Explicit Lower Bound for TSP with Distances One and Two

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

An Explicit Lower Bound for TSP with Distances One and Two

Lars Engebretsen

Journal Title: Algorithmica

Date: 2003

Volume: 35

Issue: 4

p. 301 - 318

We have been looking for this document on the Web. We think we have found the following, freely available version(s) of it:

ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1998/TR98-046/pub/eccc/reports/1998/TR98-046/Paper.pdf/engebretsen98explicit.pdf

ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1998/TR98-046/pub/eccc/reports/1998/TR98-046/Paper.ps.gz/engebretsen98explicit.ps

ftp://ftp.nada.kth.se/Theory/Lars-Engebretsen/TSP12.pdf/engebretsen98explicit.pdf

ftp://ftp.nada.kth.se/Theory/Lars-Engebretsen/TSP12.ps.gz/engebretsen98explicit.ps

For further information about this item go to:

http://link.springer.de/link/service/journals/00453/contents/02/1001/index.html

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12