✦ LIBER ✦

Tightening the upper bound for the minimum energy broadcasting

✍ Scribed by Michele Flammini; Ralf Klasing; Alfredo Navarra; Stephane Perennes

Publisher: Springer
Year: 2007
Tongue: English
Weight: 812 KB
Volume: 14
Category: Article
ISSN: 1022-0038
DOI: 10.1007/s11276-006-0007-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Results for the M

Improved Approximation Results for the Minimum Energy Broadcasting Problem

✍ Michele Flammini; Ralf Klasing; Alfredo Navarra; Stephane Perennes 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 459 KB

Lower bounds for the size in four famili

Lower bounds for the size in four families of minimum broadcast graphs

✍ J.-F. Saclé 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 469 KB

An upper bound for the minimum rank of a

An upper bound for the minimum rank of a graph

✍ Avi Berman; Shmuel Friedland; Leslie Hogben; Uriel G. Rothblum; Bryan Shader 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 137 KB

Some upper bounds for the energy of grap

Some upper bounds for the energy of graphs

✍ Huiqing Liu; Mei Lu; Feng Tian 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 137 KB

An upper bound for the minimum diameter

An upper bound for the minimum diameter of integral point sets

✍ Heiko Harborth; Arnfried Kemnitz; Meinhard Möller 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 243 KB

A logarithmic approximation algorithm fo

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

✍ Ioannis Caragiannis; Christos Kaklamanis; Panagiotis Kanellopoulos 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 123 KB

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