Computing instance-optimal kernels in two dimensions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4026646 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- scientific article; zbMATH DE number 7799604 (Why is no real title available?)
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- A space-optimal data-stream algorithm for coresets in the plane
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- Algorithms for polytope covering and approximation
- Almost optimal set covers in finite VC-dimension
- An optimal algorithm for computing a minimum nested nonconvex polygon
- Approximating extent measures of points.
- Computational geometry. Algorithms and applications.
- Computing instance-optimal kernels in two dimensions
- Efficient Algorithms for k-Regret Minimizing Sets
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Finding minimal nested polygons
- Fractional cascading. II: Applications
- Geometric approximation algorithms
- Introduction to algorithms.
- Minimum-perimeter enclosures
- On a circle-cover minimization problem
- On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
- Optimal algorithms for geometric centers and depth
- Practical methods for shape fitting and kinetic data structures using coresets
- Robust shape fitting via peeling and grating coresets
- Separation and approximation of polyhedral objects
- Sparse Approximation via Generating Point Sets
- Visibility and intersection problems in plane geometry
- k-regret minimizing set: efficient algorithms and hardness
This page was built for publication: Computing instance-optimal kernels in two dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7009908)
