Login / Signup
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs.
Christoph Ambühl
Thomas Erlebach
Matús Mihalák
Marc Nunkesser
Published in:
APPROX-RANDOM (2006)
Keyphrases
</>
minimum weight
bipartite graph
spanning tree
weighted graph
maximum cardinality
minimum spanning tree
planar graphs
constant factor approximation
edge weights
approximation algorithms
minimum cost
graph theory
greedy heuristic
undirected graph
connected components
shortest path
supervised learning
search space