An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs.

Zachary Friggstad Ramin Mousavi

Published in: ICALP (2023)

Keyphrases

planar graphs
steiner tree
minimum spanning tree
linear programming relaxation
minimum weight
partition function
closed form
facility location
shortest path
weighted graph
undirected graph
approximation algorithms
approximate inference
probability distribution
upper bound
bipartite graph