Pages that link to "Item:Q3453289"
From MaRDI portal
The following pages link to Linear-Time Approximation Algorithms for Unit Disk Graphs (Q3453289):
Displaying 9 items.
- Plane hop spanners for unit disk graphs: simpler and better (Q2206719) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- Approximating 2-cliques in unit disk graphs (Q2636809) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs (Q3638887) (← links)
- Simple heuristics for unit disk graphs (Q4698229) (← links)
- An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem (Q5434450) (← links)
- Approximate Distance Queries in Disk Graphs (Q5443518) (← links)
- ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs (Q6059994) (← links)