Fingerprint
Dive into the research topics of 'Approximation algorithms for covering a graph by vertex‐disjoint paths of maximum total weight'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Approximation algorithms for covering a graph by vertex‐disjoint paths of maximum total weight
Shlomo Moran, Ilan Newman, Yaron Wolfstahl
Research output: Contribution to journal › Article › peer-review