Login / Signup

Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies.

Zeev Nutov
Published in: ACM Trans. Algorithms (2018)
Keyphrases
  • minimum cost
  • minimum cost flow
  • network flow problem
  • approximation algorithms
  • np hard
  • np complete
  • network flow
  • search space
  • dynamic environments
  • connected components
  • capacity constraints