Login / Signup

Improved approximation algorithms for the single-sink buy-at-bulk network design problems.

Raja JothiBalaji Raghavachari
Published in: J. Discrete Algorithms (2009)
Keyphrases
  • approximation algorithms
  • network design problem
  • np hard
  • special case
  • vertex cover
  • worst case
  • primal dual
  • randomized algorithms
  • minimum cost
  • exact algorithms
  • constant factor
  • approximation ratio
  • scheduling problem