Login / Signup

Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces.

Sándor Kisfaludi-BakJesper NederlofErik Jan van Leeuwen
Published in: ACM Trans. Algorithms (2020)
Keyphrases
  • worst case
  • optimization problems
  • minimum spanning tree
  • computational complexity
  • lower bound
  • special case
  • shortest path
  • steiner tree