Pages that link to "Item:Q5060154"
From MaRDI portal
The following pages link to Greedy algorithms for the on-line steiner tree and generalized steiner problems (Q5060154):
Displaying 8 items.
- On-line Steiner trees in the Euclidean plane (Q685176) (← links)
- The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems (Q1313740) (← links)
- Competitive distributed file allocation. (Q1427858) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- An average case analysis of a greedy algorithm for the on-line Steiner tree problem (Q1921250) (← links)
- A survey of combinatorial optimization problems in multicast routing (Q2387246) (← links)
- Non-greedy online Steiner trees on outerplanar graphs (Q2659774) (← links)
- The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem (Q4680416) (← links)