David P. Williamson
Home
Posts
Publications
Talks
Courses
Contact
CV
A faster, better approximation algorithm for the minimum latency problem.
Aaron Archer
,
Asaf Levin
,
David P. Williamson
October 2008
Traveling Salesman Problem
,
Routing
Cite
DOI
Type
Journal article
Publication
SIAM Journal on Computing
37:1472-1498, 2008.
Cite
×