Pages that link to "Item:Q483059"
From MaRDI portal
The following pages link to Approximation algorithms for maximum independent set of a unit disk graph (Q483059):
Displaying 13 items.
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions (Q2380046) (← 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)
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)
- Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line (Q3467840) (← 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)
- Covering and packing of triangles intersecting a straight line (Q5918763) (← links)
