Pages that link to "Item:Q1801732"
From MaRDI portal
The following pages link to Approximation algorithms for solving packing problems of convex polygons in plane (Q1801732):
Displaying 8 items.
- Numerical optimization method for packing regular convex polygons (Q519665) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- (Q2728847) (← links)
- Improved approximation algorithms for rectangle tiling and packing. (Q2768328) (← links)
- (Q2970472) (← links)
- (Q4723586) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)
- Precise determination of the saturation coverage of polygons in silico using exclusion assisted packing technique (Q6043465) (← links)