An $O(\log k)$-Approximation for Directed Steiner Tree in Planar Graphs.
Zachary FriggstadRamin MousaviPublished in: CoRR (2023)
Keyphrases
- planar graphs
- steiner tree
- minimum spanning tree
- minimum weight
- partition function
- facility location
- linear programming relaxation
- shortest path
- approximation algorithms
- integer programming
- closed form
- linear programming
- upper bound
- approximate inference
- evolutionary algorithm
- social network analysis
- ant colony optimization