An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs

DOI10.1109/TC.2011.64zbMath1365.68359OpenAlexW2135561184MaRDI QIDQ5277608

Srivathsan Srinivasagopalan, Costas Busch, S. Sitharama Iyengar

Publication date: 12 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2011.64

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

Reliability analysis based on the dual-CIST in shuffle-cubes

This page was built for publication: An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs