✦ LIBER ✦

Improved Approximation Results for the Minimum Energy Broadcasting Problem

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

Publisher: Springer
Year: 2007
Tongue: English
Weight: 459 KB
Volume: 49
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9077-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Approximation results for the minimum gr

Approximation results for the minimum graph coloring problem

✍ Marc Demange; Pascal Grisoni; Vangelis Th. Paschos 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 381 KB

An improved approximation ratio for the

An improved approximation ratio for the minimum latency problem

✍ Michel Goemans; Jon Kleinberg 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 860 KB

Tightening the upper bound for the minim

Tightening the upper bound for the minimum energy broadcasting

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

The minimum broadcast time problem for s

The minimum broadcast time problem for several processor networks

✍ Klaus Jansen; Haiko Müller 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

On approximation algorithms for the mini

On approximation algorithms for the minimum satisfiability problem

✍ M.V. Marathe; S.S. Ravi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB