Improved approximation algorithms for the quality of service Steiner tree problem.

DOI10.1007/B11837MaRDI QIDQ5900771zbMATH OpenFDO

Authors Marek Karpinski, Ion Măndoiu, Alex Olshevsky, Alex Zelikovsky

Publication date 20 April 2010

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

Full work available at URL https://doi.org/10.1007/B11837

Mathematics Subject Classification ID

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

Recommendations

• Improved approximation algorithms for the quality of service multicast tree problem
• scientific article; zbMATH DE number 1445376
• Multi-Level Steiner Trees.
• New approximation algorithms for the Steiner tree problems
• scientific article; zbMATH DE number 742979

Cited in

(2)

• Improved approximation algorithms for the quality of service multicast tree problem
• Multi-level Steiner trees

This page was built for publication: Improved approximation algorithms for the quality of service Steiner tree problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900771)