Pages that link to "Item:Q3771608"
From MaRDI portal
The following pages link to Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608):
Displayed 44 items.
- Geometric Knapsack problems (Q689105) (← links)
- Robustness of regional matching scheme over global matching scheme (Q814437) (← links)
- The inverse protein folding problem on 2D and 3D lattices (Q876470) (← links)
- Minimum-energy broadcast and disk cover in grid wireless networks (Q930903) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem (Q941553) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- Covering a line segment with variable radius discs (Q960389) (← links)
- Approximation algorithms for hitting objects with straight lines (Q1173978) (← links)
- Covering a set of points in multidimensional space (Q1183467) (← links)
- A basic algorithm for computer-aided design of material arrangement (Q1192502) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- Label placement by maximum independent set in rectangles (Q1276946) (← links)
- An optimal algorithm for solving collision distance between convex polygons in plane (Q1312900) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- The complexity of base station positioning in cellular networks (Q1775056) (← links)
- Smooth kinetic maintenance of clusters (Q1775777) (← links)
- An improved algorithm for the packing of unequal circles within a larger containing circle (Q1847187) (← links)
- An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
- Approximating uniform triangular meshes in polygons. (Q1853569) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Approximation algorithms for aligning points (Q1879366) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Two personification strategies for solving circles packing problem (Q1974210) (← links)
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) (← links)
- PERM for solving circle packing problem (Q2459405) (← links)
- Improper colouring of (random) unit disk graphs (Q2476286) (← links)
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
- New heuristics for packing unequal circles into a circular container (Q2489278) (← links)
- A new heuristic recursive algorithm for the strip rectangular packing problem (Q2489283) (← links)
- On optimal placement of relay nodes for reliable connectivity in wireless sensor networks (Q2498988) (← links)
- On the complexity of some geometric problems in unbounded dimension (Q2638782) (← links)
- Grid scheduling by on-line rectangle packing (Q3156825) (← links)
- PACKING A TRUCK — NOW WITH A TWIST! (Q3503017) (← links)
- Spectrum Bidding in Wireless Networks and Related (Q3511367) (← links)
- On Covering Problems of Rado (Q3512467) (← links)
- Stabbing Convex Polygons with a Segment or a Polygon (Q3541074) (← links)
- Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
- Covering Points by Unit Disks of Fixed Location (Q5387798) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- Approximation algorithms for maximum two-dimensional pattern matching (Q5941062) (← links)
- On point covers of \(c-\)oriented polygons (Q5941498) (← links)
- Approximations for Steiner trees with minimum number of Steiner points (Q5958113) (← links)