Pages that link to "Item:Q5060117"
From MaRDI portal
The following pages link to Algorithms for polytope covering and approximation (Q5060117):
Displaying 32 items.
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space (Q338040) (← links)
- Angle covers: algorithms and complexity (Q782165) (← links)
- Guarding galleries and terrains (Q845875) (← links)
- Hausdorff approximation of 3D convex polytopes (Q963404) (← links)
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees (Q1367169) (← links)
- On some polyhedra covering problems (Q1592841) (← links)
- An algorithm of polynomial order for computing the covering dimension of a finite space (Q1644532) (← links)
- On the combinatorial complexity of approximating polytopes (Q1688856) (← links)
- On the VC-dimension of unique round-trip shortest path systems (Q1730015) (← links)
- Geometric hitting set for segments of few orientations (Q1743112) (← links)
- On the geometric interpretation of the nonnegative rank (Q1758469) (← links)
- Linear time approximation of 3D convex polytopes (Q1862132) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- On separating points by lines (Q1985301) (← links)
- Covering a simplex by spheres: complexity and algorithms (Q2162517) (← links)
- Sparse convex hull coverage (Q2230408) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces (Q2403743) (← links)
- Algorithms for the frame of a finitely generated unbounded polyhedron (Q2892275) (← links)
- On approximating the depth and related problems (Q2921754) (← links)
- Universal Guard Problems (Q3177901) (← links)
- (Q4352782) (← links)
- Approximate Polytope Membership Queries (Q4600697) (← links)
- Sparse Approximation via Generating Point Sets (Q4972677) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- On the complexity of approximating and illuminating three-dimensional convex polyhedra (Q5057423) (← links)
- Algorithms of optimal set covering on the planar R^2 (Q5266487) (← links)
- (Q5743375) (← links)
- Subtrajectory clustering: finding set covers for set systems of subcurves (Q5881551) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)
