Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1007590
Jump to:navigation, search

DOI10.1016/S0020-0190(02)00484-2zbMath1173.68857OpenAlexW1982951013MaRDI QIDQ1007590

Ioannis Caragiannis, Panagiotis Kanellopoulos, Christos Kaklamanis

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00484-2


zbMATH Keywords

graph algorithmsapproximation algorithmswireless networks


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Approximation algorithms (68W25)


Related Items (1)

Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks



Cites Work

  • Approximation algorithms for connected dominating sets
  • Power consumption in packet radio networks
  • Improved methods for approximating node weighted Steiner trees and connected dominating sets.
  • Minimum-energy broadcasting in static ad hoc wireless networks
  • Unnamed Item


This page was built for publication: A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1007590&oldid=13000512"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 22:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki