Sciweavers

1046 search results - page 2 / 210
» Approximation Algorithms for Domination Search
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 5 months ago
Approximation Algorithms for Dominating Set in Disk Graphs
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
Matt Gibson, Imran A. Pirwani
ICDT
2005
ACM
149views Database» more  ICDT 2005»
13 years 10 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
13 years 9 months ago
Dominance learning in diploid genetic algorithms for dynamic optimization problems
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
Shengxiang Yang
COLOGNETWENTE
2007
13 years 6 months ago
Approximating minimum independent dominating sets in wireless networks
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
Johann Hurink, Tim Nieberg