Tighter Approximation Bounds for Minimum CDS in Unit Disk Graphs.
Minming LiPeng-Jun WanF. Frances YaoPublished in: Algorithmica (2011)
Keyphrases
- upper bound
- constant factor
- lower bound
- approximation guarantees
- error bounds
- upper and lower bounds
- approximation algorithms
- stage stochastic programs
- worst case
- spanning tree
- graph matching
- error tolerance
- approximation methods
- linear programming relaxation
- greedy algorithm
- graph structure
- lower and upper bounds
- connected dominating set
- directed graph
- np hard
- markovian decision
- random graphs
- branch and bound
- graph mining
- minimum cost
- graph representation
- approximation ratio
- closed form
- graph theory
- min sum
- weighted graph
- randomized algorithm
- graph model
- graph databases
- complex structures
- queueing networks
- average case
- graph partitioning
- graph theoretic