Pages that link to "Item:Q2921456"
From MaRDI portal
The following pages link to Polynomial-Time Approximation Schemes for Circle Packing Problems (Q2921456):
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)
- PERM for solving circle packing problem (Q2459405) (← links)
- Packing disks into disks with optimal worst-case density (Q2679596) (← links)
- (Q2728847) (← links)
- Best approximate circles on integer grids (Q3707247) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)
- (Q5088965) (← links)
- A bounded space algorithm for online circle packing (Q5964819) (← links)
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes (Q6574943) (← links)