An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem (Q5505667): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing algorithm for multicast under multi-tree model in optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for multicast connection under multi-path routing model. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for multicast \(k\)-tree routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for capacitated multicast routings in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank

Latest revision as of 23:54, 28 June 2024

scientific article; zbMATH DE number 5498464
Language Label Description Also known as
English
An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem
scientific article; zbMATH DE number 5498464

    Statements

    Identifiers