Pages that link to "Item:Q2181244"
From MaRDI portal
The following pages link to Efficient independent set approximation in unit disk graphs (Q2181244):
Displaying 13 items.
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- The maximum distance-\(d\) independent set problem on unit disk graphs (Q777274) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- Faster approximation for maximum independent set on unit disk graph (Q2398507) (← links)
- Approximation algorithms for independent sets in map graphs (Q2765954) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- Geometric separation and exact solutions for the parameterized independent set problem on disk graphs (Q4815769) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q5370733) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710802) (← links)