On greedy algorithms for series parallel graphs |
| |
| Authors: | Alan J Hoffman |
| |
| Institution: | (1) Department of Mathematical Sciences, IBM Thomas J. Watson Research Center, P.O. Box 218, 10598 Yorktown Heights, NY, USA |
| |
| Abstract: | This note describes some sufficient conditions for the maximum or minimum of a weighted flow (the weights are on paths, and are derived from weights on the edges of the path), of given volume in a series parallel graph to be found by a greedy algorithm. |
| |
| Keywords: | Greedy algorithms series parallel graphs linear programming |
| 本文献已被 SpringerLink 等数据库收录！ |
|
