Login / Signup

Minimum Cost Dynamic Flows: The Series-Parallel Case.

Bettina KlinzGerhard J. Woeginger
Published in: IPCO (1995)
Keyphrases
  • minimum cost
  • series parallel
  • np hard
  • approximation algorithms
  • network flow
  • spanning tree
  • network flow problem
  • capacity constraints
  • temporal reasoning
  • upper bound
  • lower bound
  • np complete