Pages that link to "Item:Q1313740"
From MaRDI portal
The following pages link to The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems (Q1313740):
Displaying 5 items.
- Average competitive ratios of on-line spanning trees (Q287071) (← links)
- On-line Steiner trees in the Euclidean plane (Q685176) (← links)
- Greedy algorithms for the on-line steiner tree and generalized steiner problems (Q5060154) (← links)
- Improved bounds for online dominating sets of trees (Q5136272) (← links)
- Online Minimum Spanning Tree with Advice (Q5895056) (← links)