Login / Signup

Efficient sub-5 approximations for minimum dominating sets in unit disk graphs.

Guilherme Dias da FonsecaCelina M. H. de FigueiredoVinícius Gusmão Pereira de SáRaphael C. S. Machado
Published in: Theor. Comput. Sci. (2014)
Keyphrases
  • pattern recognition
  • database
  • objective function
  • lightweight
  • computationally expensive
  • complex structures
  • data mining
  • genetic algorithm
  • search engine
  • search algorithm
  • query language
  • directed graph