The non-uniform bounded degree minimum diameter spanning tree problem with an application in P2P networking

DOI10.1016/J.IPL.2012.08.015zbMath1259.68156OpenAlexW1966475009MaRDI QIDQ1941696

Jakarin Chawachat, Jittat Fakcharoenphol, Wattana Jindaluang

Publication date: 21 March 2013

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.08.015

zbMATH Keywords

graph theoryapproximation algorithmsdegree boundsspanning trees

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cites Work

• Sublogarithmic approximation for telephone multicast
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: The non-uniform bounded degree minimum diameter spanning tree problem with an application in P2P networking