A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2009.09.008 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A survey of combinatorial optimization problems in multicast routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed dual ascent algorithm for Steiner problems in multicast routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-world characteristics of internet topologies and implications on multicast scaling / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2009.09.008 / rank
 
Normal rank

Latest revision as of 18:21, 17 December 2024

scientific article
Language Label Description Also known as
English
A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
scientific article

    Statements

    Identifiers