Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight

Shlomo Moran, Ilan Newman, Yaron Wolfstahl. Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight. Networks, 20(1):55-64, 1990. [doi]

Authors

Shlomo Moran

This author has not been identified. Look up 'Shlomo Moran' in Google

Ilan Newman

This author has not been identified. Look up 'Ilan Newman' in Google

Yaron Wolfstahl

This author has not been identified. Look up 'Yaron Wolfstahl' in Google