A Constant-Factor Approximation for Quasi-Bipartite Directed Steiner Tree on Minor-Free Graphs.
Zachary FriggstadRamin MousaviPublished in: APPROX/RANDOM (2023)
Keyphrases
- steiner tree
- undirected graph
- approximation algorithms
- constant factor approximation
- minimum spanning tree
- graph model
- bipartite graph
- graph partitioning
- spanning tree
- weighted graph
- graph theory
- directed graph
- shortest path
- np hard
- facility location
- linear programming relaxation
- edge weights
- linear programming
- closest string
- simulated annealing