Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes.
Daiki HoshikaEiji MiyanoPublished in: AAIM (2014)
Keyphrases
- approximation algorithms
- steiner tree
- undirected graph
- packing problem
- np hard
- special case
- shortest path
- vertex cover
- worst case
- minimum spanning tree
- facility location
- approximation ratio
- primal dual
- set cover
- minimum cost
- constant factor
- disjoint paths
- randomized algorithms
- linear programming relaxation
- evolutionary algorithm
- computational complexity
- optimal solution
- bayesian networks