An improved approximation algorithm for capacitated multicast routings in networks (Q2474074): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975490853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / 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: Routing algorithm for multicast under multi-tree model in optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: Q4952699 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:18, 27 June 2024

scientific article
Language Label Description Also known as
English
An improved approximation algorithm for capacitated multicast routings in networks
scientific article

    Statements

    An improved approximation algorithm for capacitated multicast routings in networks (English)
    0 references
    0 references
    0 references
    5 March 2008
    0 references
    approximation algorithm
    0 references
    graph algorithm
    0 references
    multicast routing problem
    0 references
    network optimization
    0 references
    tree cover
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references