Pages that link to "Item:Q1921250"
From MaRDI portal
The following pages link to An average case analysis of a greedy algorithm for the on-line Steiner tree problem (Q1921250):
Displaying 4 items.
- Average competitive ratios of on-line spanning trees (Q287071) (← links)
- 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)
- Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space (Q1336762) (← links)