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 of f...

Full description

Bibliographic Details
Main Author: Coelho, Rafael Santos
Other Authors: Wakabayashi, Yoshiko
Format: Others
Language:en
Published: Biblioteca Digitais de Teses e Dissertações da USP 2017
Subjects:
Algoritmos de aproximação
Approximation algorithms
Complexidade computacional
Computational complexity
Conjunto dominante conexo de k-saltos
Inapproximability threshold
K-disruptive separator
K-hop connected dominating set
Limiar de inaproximabilidade
Poliedro
Polyhedra
Separador k-disruptivo minimal
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