Login / Signup

Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems.

Zeev Nutov
Published in: CSR (2016)
Keyphrases
  • approximation algorithms
  • min cost
  • vertex cover
  • combinatorial optimization problems
  • np hard
  • network flow
  • special case
  • max flow
  • worst case
  • optimization problems
  • primal dual
  • dynamic programming