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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.