Login / Signup

Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems.

Fedor V. FominDaniel LokshtanovSudeshna KolayFahad PanolanSaket Saurabh
Published in: ACM Trans. Algorithms (2020)
Keyphrases
  • optimization problems
  • computational complexity
  • graph theory
  • steiner tree
  • social networks
  • lower bound
  • simulated annealing
  • graphical models
  • computationally expensive
  • cutting plane