Pages that link to "Item:Q1157170"
From MaRDI portal
The following pages link to Optimal packing and covering in the plane are NP-complete (Q1157170):
Displayed 50 items.
- Max point-tolerance graphs (Q344833) (← links)
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane (Q412277) (← links)
- Approximation algorithms for free-label maximization (Q419365) (← links)
- Covering moving points with anchored disks (Q421753) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Unit disk cover problem in 2D (Q491638) (← links)
- Matching colored points with rectangles (Q511687) (← links)
- Numerical optimization method for packing regular convex polygons (Q519665) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Covering a polygonal region by rectangles (Q538294) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Theory and application of width bounded geometric separators (Q632801) (← links)
- Piercing translates and homothets of a convex body (Q634671) (← links)
- Approximation algorithms for the unit disk cover problem in 2D and 3D (Q680146) (← links)
- A streaming algorithm for 2-center with outliers in high dimensions (Q680151) (← links)
- An improved approximation algorithm for the most points covering problem (Q692901) (← links)
- Orthogonal segment stabbing (Q705557) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- A clustering-based approach to kinetic closest pair (Q722518) (← links)
- Path optimization with limited sensing ability (Q729301) (← links)
- Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
- A simple heuristic for the p-centre problem (Q761233) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- Convexity in partial cubes: the hull number (Q898152) (← links)
- On covering problems of Rado (Q970613) (← links)
- The cubicity of hypercube graphs (Q998463) (← links)
- Translational packing of arbitrary polytopes (Q1005325) (← links)
- Minimal sensor integrity: Measuring the vulnerability of sensor grids (Q1007573) (← links)
- An upper bound for cubicity in terms of boxicity (Q1025528) (← links)
- A note on maximum independent sets in rectangle intersection graphs (Q1029038) (← links)
- An improved algorithm for online unit clustering (Q1040649) (← links)
- On the cubicity of certain graphs (Q1041732) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Location problems (Q1062596) (← links)
- Diameter partitioning (Q1076974) (← links)
- A heuristic for the p-center problem in graphs (Q1098862) (← links)
- Geometric optimization and the polynomial hierarchy (Q1102110) (← links)
- Geometric optimization and \(D^ P\)-completeness (Q1106665) (← links)
- Covering a set of points in multidimensional space (Q1183467) (← links)
- Packing problems (Q1197916) (← links)
- On genetic algorithms for the packing of polygons (Q1266576) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- Label placement by maximum independent set in rectangles (Q1276946) (← links)
- Computing closely matching upper and lower bounds on textile nesting problems (Q1296780) (← links)
- On the complexity of two circle connecting problems (Q1314320) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Optimal packing of similar triangles (Q1345878) (← links)