Login / Signup
Approximating minimum-cost connectivity problems via uncrossable bifamilies.
Zeev Nutov
Published in:
ACM Trans. Algorithms (2012)
Keyphrases
</>
minimum cost
minimum cost flow
np hard
network flow problem
approximation algorithms
network simplex algorithm
np complete
evolutionary algorithm
network flow