Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem
From MaRDI portal
(Redirected from Publication:3637083)
Recommendations
- Size-constrained tree partitioning: approximating the multicast k-tree routing problem
- Approximation algorithms for the k-source multicast tree construction problem
- An improved approximation algorithm for multicast \(k\)-tree routing
- A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
- An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
- scientific article; zbMATH DE number 1990677
- Improved approximation algorithms for the quality of service multicast tree problem
- Computational Science and Its Applications – ICCSA 2004
- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- Efficient algorithms for a constrained k-tree core problem in a tree network
Cited in
(5)- Balanced tree partition problems with virtual nodes
- An improved approximation algorithm for multicast \(k\)-tree routing
- Approximation algorithms for the k-source multicast tree construction problem
- Computing and Combinatorics
- Size-constrained tree partitioning: approximating the multicast k-tree routing problem
This page was built for publication: Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637083)