Pages that link to "Item:Q1987245"
From MaRDI portal
The following pages link to Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245):
Displaying 4 items.
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- A note on a QPTAS for maximum weight triangulation of planar point sets (Q2448113) (← links)
- Polynomial-time approximation schemes for geometric graphs (Q2768362) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)