A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 13:21, 2 July 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
A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (English)
0 references
18 March 2010
0 references
distributed algorithms
0 references
multicast routing
0 references
Steiner tree
0 references
