Pages that link to "Item:Q1594186"
From MaRDI portal
The following pages link to On the complexity of asymptotically optimal coverings and packings (Q1594186):
Displaying 10 items.
- Numerical optimization method for packing regular convex polygons (Q519665) (← links)
- On the difference between asymptotically good packings and coverings (Q1345524) (← links)
- A nearly-optimal transfixing set (Q1363972) (← links)
- Bounds for optimal coverings (Q1827869) (← links)
- Application of probability methods to the problem of construction of optimal coverings (Q1921677) (← links)
- Method for constructing optimal dark coverings (Q1991636) (← links)
- Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set (Q2332657) (← links)
- Asymptotics of weighted best-packing on rectifiable sets (Q3617345) (← links)
- Approximation Schemes for Covering and Packing (Q4914438) (← links)
- On the Number and Arrangement of Sensors for the Multiple Covering of Bounded Plane Domains (Q4973240) (← links)