Pages that link to "Item:Q5757904"
From MaRDI portal
The following pages link to Better Approximation Schemes for Disk Graphs (Q5757904):
Displaying 7 items.
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs (Q884483) (← links)
- The Number of Bits Needed to Represent a Unit Disk Graph (Q3057635) (← links)
- Global Rigidity of Unit Ball Graphs (Q5210905) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)