๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem

โœ Scribed by Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
123 KB
Volume
86
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

โœฆ Synopsis

Motivated by the problem of supporting energy-efficient broadcasting in ad hoc wireless networks, we study the Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. We present the first logarithmic approximation algorithm for the problem which uses an interesting reduction to Node-Weighted Connected Dominating Set.

๐Ÿ“œ SIMILAR VOLUMES

A Better Approximation Ratio for the Min
A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
โœ Cristina G Fernandes ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 213 KB

Consider the minimum size k-edge-connected spanning subgraph problem: given a positive integer k and a k-edge-connected graph G, find a k-edge-connected spanning subgraph of G with the minimum number of edges. This problem is known to be NP-complete. Khuller and Raghavachari presented the first algo

A linear time 53-approximation for the m
A linear time 53-approximation for the minimum strongly-connected spanning subgraph problem
โœ Liang Zhao; Hiroshi Nagamochi; Toshihide Ibaraki ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 134 KB

A linear time 5 3 -approximation algorithm is presented for the NP-hard problem of finding a minimum strongly-connected spanning subgraph. It is based on cycle contraction that was first introduced by Khuller, Raghavachari and Young [SIAM J. Comput. 24 (1995) 859-872]. We improve their result by con