Pages that link to "Item:Q6110632"
From MaRDI portal
The following pages link to A fast approximation algorithm for the maximum 2-packing set problem on planar graphs (Q6110632):
Displaying 4 items.
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)