| Article ID: | iaor20114448 |
| Volume: | 111 |
| Issue: | 11 |
| Start Page Number: | 533 |
| End Page Number: | 537 |
| Publication Date: | May 2011 |
| Journal: | Information Processing Letters |
| Authors: | Krumke Sven O, Thielen Clemens |
| Keywords: | approximation, NP-complete |
? Proof of strong NP‐completeness of Min Cost Network Flow with Minimum Quantities. ? Pseudo‐polynomial time dynamic programming algorithm on series‐parallel graphs. ? Fully polynomial time approximation scheme (FPTAS) on series‐parallel graphs.