Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
32
click to vote
TOC
2008
favorite
Email
discuss
report
95
views
more
TOC 2008
»
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem
13 years 11 months ago
Download
theoryofcomputing.org
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
Viswanath Nagarajan
Real-time Traffic
Corrected Linear Relaxation
|
LP Relaxation
|
Salesman Path Problem
|
TOC 2008
|
claim paper
Post Info
More Details (n/a)
Added
15 Dec 2010
Updated
15 Dec 2010
Type
Journal
Year
2008
Where
TOC
Authors
Viswanath Nagarajan
Comments
(0)
Researcher Info
TOC 2008 Study Group
Computer Vision