Login / Signup
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of edge dominating set.
Bruno Escoffier
Jérôme Monnot
Vangelis Th. Paschos
Mingyu Xiao
Published in:
IPEC (2012)
Keyphrases
</>
dominating set
approximation algorithms
facility location problem
undirected graph
connected dominating set
np hard
special case
worst case
edge detection
edge information
dynamic programming
edge detector
polynomial time approximation
evolutionary algorithm
weighted graph