Login / Signup
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs.
Sylvain Gravier
Ralf Klasing
Julien Moncel
Published in:
Algorithmic Oper. Res. (2008)
Keyphrases
</>
approximation algorithms
np hard
worst case
np hardness
special case
undirected graph
approximation ratio
facility location problem
vertex cover
open shop
disjoint paths
constant factor
primal dual
minimum cost
network design problem
polynomial time approximation
lower bound