On Min-Power Steiner Tree

DOI10.1007/978-3-642-33090-2_46zbMath1365.68356arXiv1205.3605OpenAlexW1890364157MaRDI QIDQ2912871

Fabrizio Grandoni

Publication date: 25 September 2012

Published in: Algorithms – ESA 2012 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

The online broadcast range-assignment problem ⋮ Combination algorithms for Steiner tree variants ⋮ The Online Broadcast Range-Assignment Problem ⋮ Improved approximation algorithms for minimum power covering problems ⋮ 1.61-approximation for min-power strong connectivity with two power levels

This page was built for publication: On Min-Power Steiner Tree