New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- 1 January 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (1) , 254-262
- https://doi.org/10.1137/s009753979528826x
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- The prize collecting traveling salesman problemNetworks, 1989
- The orienteering problemNaval Research Logistics (NRL), 1987