Minimum color spanning circle in imprecise setup
From MaRDI portal
Publication:2695293
DOI10.1007/978-3-030-89543-3_22OpenAlexW3209855145MaRDI QIDQ2695293FDOQ2695293
Authors: Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell 
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_22
Cites Work
- Planar Formulae and Their Uses
- The Problem of Compatible Representatives
- The upper envelope of Voronoi surfaces and its applications
- Computing the smallest color-spanning axis-parallel square
- Title not available (Why is that?)
- Systems of distant representatives
- Computing minimum diameter color-spanning sets is hard
- On some geometric problems of color-spanning sets
- NP-Completeness of Spreading Colored Points
- SMALLEST COLOR-SPANNING OBJECT REVISITED
- TSP with neighborhoods of varying size
- The directed Hausdorff distance between imprecise point sets
- An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
- Geometric Avatar Problems
- Largest bounding box, smallest diameter, and related problems on imprecise points
- Approximation algorithms for spreading points
- Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
- Dispersion in disks
- Minimum width color spanning annulus
- Shortest color-spanning intervals
This page was built for publication: Minimum color spanning circle in imprecise setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695293)
