Pages that link to "Item:Q1310949"
From MaRDI portal
The following pages link to The Steiner problem in distributed computing systems (Q1310949):
Displaying 12 items.
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees (Q388463) (← links)
- Maximum metric spanning tree made Byzantine tolerant (Q494938) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038) (← links)
- Minimal communication cost software construction in the Internet environment (Q1920220) (← links)
- A survey of combinatorial optimization problems in multicast routing (Q2387246) (← links)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree (Q5012805) (← links)
- Optimal cost-sensitive distributed minimum spanning tree algorithm (Q5054817) (← links)
- A distributed dual ascent algorithm for Steiner problems in multicast routing (Q5191138) (← links)
- Parallelism in Steiner systems (Q5198025) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)