Login / Signup

Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems.

Rohan GhugeViswanath Nagarajan
Published in: SODA (2020)
Keyphrases
  • computationally expensive
  • approximation algorithms
  • network design problem
  • bayesian networks
  • computational complexity
  • greedy algorithm