Login / Signup

A practical greedy approximation for the directed Steiner tree problem.

Dimitri WatelMarc-Antoine Weisser
Published in: J. Comb. Optim. (2016)
Keyphrases
  • greedy algorithm
  • practical application
  • probabilistic model
  • practical problems
  • information systems
  • search algorithm
  • approximation schemes
  • lower bound
  • search space
  • dynamic programming
  • response time
  • relative error