Search Results - "Distributed approximation algorithm"

Improved distributed approximation for Steiner tree in the CONGEST model by Saikia, Parikshit, Karmakar, Sushanta

“…•Improved distributed approximation for Steiner tree.•Approximation algorithms for Steiner tree in the CONGEST model of distributed computing.•Steiner tree…”
Get full text

Semi-asynchronous and distributed weighted connected dominating set algorithms for wireless sensor networks by Dagdeviren, Orhan, Erciyes, Kayhan, Tse, Savio

“…Energy-efficient backbone construction is one of the most important objective in a wireless sensor network (WSN) and to construct a more robust backbone,…”
Get full text

An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs by Kamei, Sayaka, Izumi, Tomoko, Yamauchi, Yukiko

“…A connected dominating set (CDS) is useful in forming a virtual backbone in wireless ad hoc or sensor networks because these networks lack a fixed…”
Get full text

A fast distributed approximation algorithm for minimum spanning trees by Khan, Maleq, Pandurangan, Gopal

“…We present a distributed algorithm that constructs an O (log n )-approximate minimum spanning tree (MST) in any arbitrary network. This algorithm runs in time…”
Get full text

An improved distributed data aggregation scheduling in wireless sensor networks by Li, Deying, Zhu, Qinghua, Du, Hongwei, Li, Jianzhong

“…This paper focuses on the distributed data aggregation collision-free scheduling problem, which is one of very important issues in wireless sensor networks. Bo…”
Get full text

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks by Gao, Bo, Yang, Yuhang, Ma, Huiye

“…In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless…”
Get full text

Approximation algorithms for channel allocation problems in broadcast networks by Gandhi, Rajiv, Khuller, Samir, Srinivasan, Aravind, Wang, Nan

“…We study two packing problems that arise in the area of dissemination‐based information systems; a second theme is the study of distributed approximation…”
Get full text

2(1 - 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE by Saikia, Parikshit, Karmakar, Sushanta

“…We study the Steiner tree problem in the CONGESTED CLIQUE model of distributed computing. We present a deterministic distributed approximation algorithm that…”
Get full text