Pages that link to "Item:Q329299"
From MaRDI portal
The following pages link to Polynomial-time approximation schemes for circle and other packing problems (Q329299):
Displaying 10 items.
- Split packing: algorithms for packing circles with optimal worst-case density (Q1731458) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- Techniques and results on approximation algorithms for packing circles (Q2082050) (← links)
- Online circle and sphere packing (Q2419121) (← links)
- PERM for solving circle packing problem (Q2459405) (← links)
- (Q2728847) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- Polynomial-time approximation schemes for packing and piercing fat objects (Q4808318) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)
- Placing your Coins on a Shelf (Q5136217) (← links)