Pages that link to "Item:Q867854"
From MaRDI portal
The following pages link to Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854):
Displaying 10 items.
- Independent sets in graphs (Q501998) (← links)
- Online algorithms with advice: the tape model (Q529045) (← links)
- Scheduling to maximize participation (Q935466) (← links)
- Online independent sets. (Q1853575) (← links)
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- Scheduling to Maximize Participation (Q3608460) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311098) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q5370733) (← links)
- Online class cover problem (Q6600810) (← links)