Login / Signup
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph.
Jonathan Li
Rohan Potru
Farhad Shahrokhi
Published in:
Algorithms (2020)
Keyphrases
</>
approximation algorithms
dominating set
facility location problem
np hard
connected dominating set
worst case
special case
undirected graph
approximation schemes
vertex cover
connected components
greedy algorithm
multistage
minimum cost
primal dual
facility location
random walk
polynomial time approximation