PTAS’s for Some Metric p-source Communication Spanning Tree Problems

DOI10.1007/978-3-319-15612-5_13zbMath1432.68583OpenAlexW171992297MaRDI QIDQ5176579

Santiago Valdés Ravelo, Carlos E. Ferreira

Publication date: 27 February 2015

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15612-5_13

Mathematics Subject Classification ID

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

Related Items (3)

On the minimum routing cost clustered tree problem ⋮ A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem ⋮ A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem

This page was built for publication: PTAS’s for Some Metric p-source Communication Spanning Tree Problems