Search Results - "Distributed approximation algorithm"

A New Distributed Approximation Algorithm for the Maximum Weight Independent Set Problem by Du, Peng, Zhang, Yuan

“… This paper studies distributed approximation algorithms for finding MWIS in a general graph…”
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

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

A distributed approximation algorithm for the bottleneck connected dominating set problem by Verma, Anurag, Butenko, Sergiy

“…Some of the most popular routing protocols for wireless sensor networks require a virtual backbone for efficient communication between the sensors. Connected…”
Get full text

An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique by Saikia, Parikshit

“…We study the Traveling Salesman Problem (TSP) in the Congested Clique Model (CCM) of distributed computing. We present a deterministic distributed algorithm…”
Get full text

A distributed approximation algorithm for the minimum degree minimum weight spanning trees by Lavault, Christian, Valencia-Pabon, Mario

“…Fischer proposes in [T. Fischer, Optimizing the degree of minimum weight spanning trees, Technical Report 93–1338, Department of Computer Science, Cornell…”
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 this paper, we present a new distributed approximation algorithm…”
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

An O(log n) Distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks by Dongxiao Yu, Qiang-Sheng Hua, Yuexuan Wang, Lau, F. C. M.

“…The unstructured multi-hop radio network model, with asynchronous wake-up, no collision detection and little knowledge on the network topology, is proposed for…”
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

An improved distributed approximation algorithm for minimum connected dominating set by Shenyong Gao, Ying Zhang

“…To determine the minimum connected dominating set (MCDS) in wireless networks, an improved distributed approximation algorithm, which exploited the connectivity…”
Get full text

A Primal-Dual based Distributed Approximation Algorithm for Prize-Collecting Steiner Tree by Saikia, Parikshit, Karmakar, Sushanta, Pagourtzis, Aris T

“…The Prize-Collecting Steiner Tree (PCST) problem is a generalization of the Steiner Tree problem that has applications in network design, content distribution…”
Get full text

A Self-Stabilizing Distributed Approximation Algorithm for the Minimum Connected Dominating Set by Kamei, S., Kakugawa, H.

“… In this paper, we propose a self-stabilizing distributed approximation algorithm for the minimum connected dominating set, which can be used, for example, as a virtual backbone or routing in mobile ad hoc networks…”
Get full text

A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model by Khan, Maleq, Anil Kumar, V S, Pandurangan, Gopal, Guanhong Pei

“… In this paper, we develop a fast distributed approximation algorithm for MST construction in an SINR based distributed computing model. For an \(n…”
Get full text

A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model by Briest, Patrick, Degener, Bastian, Kempkes, Barbara, Kling, Peter, Pietrzyk, Peter

“…We present a randomized distributed approximation algorithm for the metric uncapacitated facility location problem…”
Get full text

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

“…In this paper, we present a new distributed approximation algorithm that constructs a minimum connected dominating set (MCDS…”
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 present a deterministic distributed approximation algorithm that computes a Steiner tree in Õ(n^1/3) rounds and Õ(n^7/3…”
Get full text

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

“…; a second theme is the study of distributed approximation algorithms. The problems considered have the property that the space occupied by a collection of objects…”
Get full text

A distributed approximation algorithm for the minimum degree minimum weight spanning trees by Lavault, Christian, Valencia-Pabon, Mario

“…Fischer has shown how to compute a minimum weight spanning tree of degree at most \(b \Delta^* + \lceil \log\_b n\rceil\) in time \(O(n^{4 + 1/\ln b})\) for…”
Get full text