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: SODA (2019)
Keyphrases
  • worst case
  • line drawings
  • genetic algorithm
  • face recognition
  • lower bound
  • multi objective
  • bipartite graph