The parallel complexity of TSP heuristics

1989

Journal of Algorithms , Volume 10 - Issue 2 p. 249- 270

Additional Metadata
MSC	Network models, deterministic (msc 90B10), Analysis of algorithms and problem complexity (msc 68Q25)
Publisher	Academic Press
Journal	Journal of Algorithms
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Kindervater, G., Lenstra, J. K., & Shmoys, D. B. (1989). The parallel complexity of TSP heuristics. Journal of Algorithms, 10(2), 249–270.

Publication