Pages that link to "Item:Q3638887"
From MaRDI portal
The following pages link to Approximation Algorithms for Domatic Partitions of Unit Disk Graphs (Q3638887):
Displaying 7 items.
- Optimally decomposing coverings with translates of a convex polygon (Q635757) (← links)
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- Approximating 2-cliques in unit disk graphs (Q2636809) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)