Pages that link to "Item:Q685176"
From MaRDI portal
The following pages link to On-line Steiner trees in the Euclidean plane (Q685176):
Displaying 11 items.
- A degree based approach to find Steiner trees (Q327685) (← links)
- The repeater tree construction problem (Q1675870) (← links)
- New results for online page replication (Q1887086) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- Parameterized analysis of the online priority and node-weighted Steiner tree problems (Q2322716) (← links)
- Non-greedy online Steiner trees on outerplanar graphs (Q2659774) (← links)
- Non-greedy Online Steiner Trees on Outerplanar Graphs (Q2971163) (← links)
- Online Priority Steiner Tree Problems (Q3183439) (← links)
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (Q3449515) (← links)
- The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online (Q3460333) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
