Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs.
Feng ZouXianyue LiDonghyun KimWeili WuPublished in: COCOA (2008)
Keyphrases
- approximation algorithms
- undirected graph
- steiner tree
- constant factor
- minimum cost
- np hard
- minimum spanning tree
- edge weights
- special case
- vertex cover
- spanning tree
- worst case
- weighted graph
- disjoint paths
- directed graph
- primal dual
- graph structure
- approximation ratio
- linear programming
- shortest path
- precedence constraints
- combinatorial auctions
- np complete
- randomized algorithms
- constant factor approximation