Login / Signup

Budget constrained minimum cost connected medians.

Goran KonjevodSven Oliver KrumkeMadhav V. Marathe
Published in: J. Discrete Algorithms (2004)
Keyphrases
  • minimum cost
  • np hard
  • network flow
  • approximation algorithms
  • spanning tree
  • network flow problem
  • network simplex algorithm
  • capacity constraints
  • minimum cost flow
  • connected components