Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs.
Ashkan AazamiJoseph CheriyanKrishnam Raju JampaniPublished in: Algorithmica (2012)
Keyphrases
- approximation algorithms
- steiner tree
- planar graphs
- vertex cover
- undirected graph
- np hard
- worst case
- minimum spanning tree
- packing problem
- special case
- minimum weight
- minimum cost
- linear programming relaxation
- np complete
- lower bound
- facility location
- integer programming
- spanning tree
- computational complexity
- primal dual
- shortest path
- linear programming
- optimal solution
- knapsack problem
- branch and bound algorithm
- binary variables
- constraint satisfaction problems
- scheduling problem
- weighted graph