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 40 items.
- Orthogonal segment stabbing (Q705557) (← links)
- A simple heuristic for the p-centre problem (Q761233) (← 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)
- 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)
- Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
- Hardness of approximation for non-overlapping local alignments. (Q1427808) (← links)
- Fast stabbing of boxes in high dimensions (Q1583093) (← links)
- Smooth kinetic maintenance of clusters (Q1775777) (← links)
- On the complexity of locating linear facilities in the plane (Q1837617) (← links)
- A mixed integer formulation for maximal covering by inclined parallelograms (Q1876161) (← links)
- A simulated annealing approach to the nesting problem in the textile manufacturing industry (Q1897378) (← links)
- The nesting problem in the leather manufacturing industry (Q1897382) (← links)
- Packing 16, 17 or 18 circles in an equilateral triangle (Q1900192) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- On the complexity of some geometric problems in unbounded dimension (Q2638782) (← links)
- Boxicity and treewidth (Q2642011) (← links)
- PACKING A TRUCK — NOW WITH A TWIST! (Q3503017) (← links)
- On Covering Problems of Rado (Q3512467) (← links)
- Decision Trees for Geometric Models (Q4513214) (← links)
- TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING (Q4682152) (← links)
- (Q4852904) (← links)
- Approximation algorithms for maximum two-dimensional pattern matching (Q5941062) (← links)
- On point covers of \(c-\)oriented polygons (Q5941498) (← links)