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

Shlomo Moran, Ilan Newman, Yaron Wolfstahl

Research output: Contribution to journalArticlepeer-review

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.

Engineering & Materials Science