Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
A DOMINATION ALGORITHM FOR {0, 1}-INSTANCES OF THE TRAVELLING SALESMAN PROBLEM DANIELA KÜHN, DERYK OSTHUS AND VIRESH PATEL Abstract. We present an approximation algorithm for {0, 1}-instances of the travelling salesman
Add to Reading List
Document Date: 2015-05-23 01:02:41
Open Document
File Size: 530,69 KB
Share Result on Facebook
A DOMINATION ALGORITHM FOR {0, 1}-INSTANCES OF THE TRAVELLING SALESMAN PROBLEM DANIELA KÜHN, DERYK OSTHUS AND VIRESH PATEL Abstract. We present an approximation algorithm for {0, 1}-instances of the travelling salesman