Energy-efficient paths in radio networks

DOI10.1007/S00453-010-9414-0zbMath1234.68022OpenAlexW1987284071MaRDI QIDQ639290

Stefan Funke, Rene Beier, Peter Sanders, Domagoj Matijević

Publication date: 20 September 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-010-9414-0

zbMATH Keywords

communication networkscomputational geometryradio networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Dynamic fractional cascading
• Universal classes of hash functions
• Dynamic Euclidean minimum spanning trees and extrema of binary functions
• Approximate range searching
• Fly Cheaply: On the Minimum Fuel Consumption Problem
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Maximal Flow Through a Network
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Power Diagrams: Properties, Algorithms and Applications
• Approximate distance oracles
• Algorithms - ESA 2003

This page was built for publication: Energy-efficient paths in radio networks