The k-hop connected dominating set problem: approximation algorithms and hardness results

The k-hop connected dominating set problem: approximation algorithms and hardness results

Let G be a connected graph and k be a positive integer. A vertex subset D of G is a k-hop connected dominating set if the subgraph of G induced by D is connected, and for every vertex v in G, there is a vertex u in D such that the distance between v and u in G is at most k. We study the problem...

Full description

Bibliographic Details
Main Author: Rafael Santos Coelho
Other Authors: Yoshiko Wakabayashi
Language:English
Published: Universidade de São Paulo 2017
Subjects:
Algoritmos de aproximação
Complexidade computacional
Conjunto dominante conexo de k-saltos
Limiar de inaproximabilidade
Poliedro
Separador k-disruptivo minimal
Approximation algorithms
Computational complexity
Inapproximability threshold
K-disruptive separator
K-hop connected dominating set
Polyhedra
Online Access:http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/

Internet

http://www.teses.usp.br/teses/disponiveis/45/45134/tde-27062017-101521/

Similar Items