default search action
"Approximation algorithms for covering a graph by vertex-disjoint paths of ..."
Shlomo Moran, Ilan Newman, Yaron Wolfstahl (1990)
- 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)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.