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):
Displaying 50 items.
- Approximation algorithms for hitting objects with straight lines (Q1173978) (← links)
- Finding a minimal cover for binary images: An optimal parallel algorithm (Q1175643) (← 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)
- Approximability and hardness of geometric hitting set with axis-parallel rectangles (Q1621500) (← links)
- An improved approximation algorithm for the discrete Fréchet distance (Q1653046) (← links)
- Interval selection in the streaming model (Q1676325) (← links)
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- Near-linear time approximation schemes for geometric maximum coverage (Q1748995) (← links)
- Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660) (← 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)
- Trimming of graphs, with application to point labeling (Q1959389) (← links)
- Two personification strategies for solving circles packing problem (Q1974210) (← links)
- An exact algorithm for a class of geometric set-cover problems (Q2030243) (← links)
- Experiments with unit disk cover algorithms for covering massive pointsets (Q2096372) (← links)
- Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← links)
- The maximum exposure problem (Q2123293) (← links)
- Weighted geometric set cover with rectangles of bounded integer side lengths (Q2133398) (← links)
- Online unit clustering and unit covering in higher dimensions (Q2134741) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- A PTAS for the horizontal rectangle stabbing problem (Q2164717) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- Liar's dominating set problem on unit disk graphs (Q2201773) (← links)
- On grids in topological graphs (Q2249043) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- A 4.31-approximation for the geometric unique coverage problem on unit disks (Q2250456) (← links)
- Optimization for first order Delaunay triangulations (Q2269140) (← links)
- Range assignment of base-stations maximizing coverage area without interference (Q2283033) (← links)
- The most points connected-covering problem with two disks (Q2322704) (← links)
- Finding, hitting and packing cycles in subexponential time on unit disk graphs (Q2334507) (← links)
- An efficient heuristic algorithm for two-dimensional rectangular packing problem with central rectangle (Q2338490) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Geometric red-blue set cover for unit squares and related problems (Q2341691) (← links)
- Shortest paths in intersection graphs of unit disks (Q2344058) (← links)
