A greedy approximation for minimum connected dominating sets.

Lu Ruan Hongwei Du Xiaohua Jia Weili Wu Yingshu Li Ker-I Ko

Published in: Theor. Comput. Sci. (2004)

Keyphrases

greedy algorithm
multiobjective optimization
search algorithm
approximation algorithms
approximation ratio
active learning
error bounds
minimum cost
multiscale
upper bound
queueing networks
constant factor
closed form
greedy search
locally optimal
definite clause