Minimum color spanning circle of imprecise points
From MaRDI portal
Publication:2166769
DOI10.1016/j.tcs.2022.07.016WikidataQ114129086 ScholiaQ114129086MaRDI QIDQ2166769
Ankush Acharyya, Maarten Löffler, Ramesh K. Jallu, Vahideh Keikha, Maria Saumell
Publication date: 25 August 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.13865
68Qxx: Theory of computing
Cites Work
- Unnamed Item
- The directed Hausdorff distance between imprecise point sets
- Dispersion in disks
- Largest and smallest convex hulls for imprecise points
- Shortest color-spanning intervals
- Approximating largest convex hulls for imprecise points
- The upper envelope of Voronoi surfaces and its applications
- Minimum width color spanning annulus
- Systems of distant representatives
- Computing minimum diameter color-spanning sets is hard
- Largest and smallest area triangles on imprecise points
- Largest bounding box, smallest diameter, and related problems on imprecise points
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- A fully polynomial time approximation scheme for the smallest diameter of imprecise points
- On some geometric problems of color-spanning sets
- On the Most Likely Convex Hull of Uncertain Points
- Computing the Smallest Color-Spanning Axis-Parallel Square
- Geometric Avatar Problems
- NP-Completeness of Spreading Colored Points
- Approximation algorithms for spreading points
- Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- Planar Formulae and Their Uses
- The Problem of Compatible Representatives
- An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
- TSP with neighborhoods of varying size
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model
