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

Sándor Kisfaludi-Bak Jesper Nederlof Erik Jan van Leeuwen

Published in: CoRR (2018)

Keyphrases

worst case
computational complexity
particle swarm optimization
computationally expensive