Login / Signup

A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm.

Satoru Fujishige
Published in: Math. Program. (1986)
Keyphrases
  • dynamic programming
  • worst case
  • probabilistic model
  • learning algorithm
  • matching algorithm
  • randomly generated
  • undirected graph
  • similarity measure
  • convergence rate