New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen

Publisher Website

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 available

This publication has 2 references indexed in Scilit:

The prize collecting traveling salesman problem
Networks, 1989
The orienteering problem
Naval Research Logistics (NRL), 1987

Cited by 88 articles