On greedy algorithms for series parallel graphs
- 1 January 1988
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 40-40 (1-3) , 197-204
- https://doi.org/10.1007/bf01580730
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Minimum cost flow algorithms for series-parallel networksDiscrete Applied Mathematics, 1985
- Classes of linear programs with integral optimal solutionsPublished by Springer Nature ,1985