A Constant-Factor Approximation for Quasi-bipartite Directed Steiner Tree on Minor-Free Graphs.
Zachary FriggstadRamin MousaviPublished in: CoRR (2021)
Keyphrases
- steiner tree
- undirected graph
- approximation algorithms
- constant factor approximation
- minimum spanning tree
- graph model
- bipartite graph
- spanning tree
- graph partitioning
- graph theory
- shortest path
- np hard
- facility location
- directed graph
- weighted graph
- search algorithm
- linear programming relaxation
- computational complexity
- decision makers
- special case
- evolutionary algorithm