✦ LIBER ✦
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
✍ Scribed by Shlomo Moran; Ilan Newman; Yaron Wolfstahl
- Publisher
- John Wiley and Sons
- Year
- 1990
- Tongue
- English
- Weight
- 464 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.