Improved approximation algorithms for the quality of service multicast tree problem
From MaRDI portal
Recommendations
- Improved approximation algorithms for the quality of service Steiner tree problem.
- An improved approximation algorithm for multicast \(k\)-tree routing
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
- Computing and Combinatorics
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
Cited in
(13)- Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
- An improved approximation algorithm for multicast \(k\)-tree routing
- Approximation algorithms for priority Steiner tree problems
- Multicast ω-Trees Based on Statistical Analysis
- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem
- scientific article; zbMATH DE number 1990677 (Why is no real title available?)
- Multi-level Steiner trees
- Multi-Level Steiner Trees.
- Approximation algorithms for the k-source multicast tree construction problem
- scientific article; zbMATH DE number 7651143 (Why is no real title available?)
- Improved approximation algorithms for the quality of service Steiner tree problem.
- Multi-priority graph sparsification
- Size-constrained tree partitioning: approximating the multicast k-tree routing problem
This page was built for publication: Improved approximation algorithms for the quality of service multicast tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484000)