Balls and Funnels: Energy Efficient Group-to-Group Anycasts

DOI10.1007/978-3-319-42634-1_19zbMath1476.68209arXiv1605.07196OpenAlexW2403753319MaRDI QIDQ2817865

Rajmohan Rajaraman, Ravi Sundaram, R. Ravi, Jennifer Iglesias

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.07196

zbMATH Keywords

approximation algorithmnetwork designwireless communication

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

Balls and Funnels: Energy Efficient Group-to-Group Anycasts

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum-energy broadcasting in static ad hoc wireless networks
• Balls and Funnels: Energy Efficient Group-to-Group Anycasts
• The Design of Approximation Algorithms
• Set connectivity problems in undirected graphs and the directed steiner network problem
• Polylogarithmic inapproximability
• Saving an epsilon
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
• Algorithms for energy-efficient multicasting in static ad hoc wireless networks

This page was built for publication: Balls and Funnels: Energy Efficient Group-to-Group Anycasts