Login / Signup
Local Approximability of Minimum Dominating Set on Planar Graphs.
Miikka Hilke
Christoph Lenzen
Jukka Suomela
Published in:
CoRR (2014)
Keyphrases
</>
dominating set
planar graphs
facility location problem
connected dominating set
approximation algorithms
undirected graph
special case
np hard
minimum cost
image segmentation
markov random field
linear program
facility location
partition function