Pages that link to "Item:Q2398507"
From MaRDI portal
The following pages link to Faster approximation for maximum independent set on unit disk graph (Q2398507):
Displaying 7 items.
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- Collision-free routing problem with restricted L-path (Q2161235) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q5370733) (← links)
- Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)