A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs.
Xianyue LiXiaoHua XuFeng ZouHongwei DuPeng-Jun WanYuexuan WangWeili WuPublished in: COCOA (2009)
Keyphrases
- branch and bound algorithm
- steiner tree
- minimum spanning tree
- edge weights
- undirected graph
- shortest path
- approximation algorithms
- np hard
- weighted graph
- finding the shortest path
- graph structure
- directed graph
- betweenness centrality
- spanning tree
- graph theory
- complex networks
- approximation schemes
- bipartite graph
- tree structure
- facility location
- linear programming relaxation
- optimization problems
- search space