Minimum color spanning circle in imprecise setup

DOI10.1007/978-3-030-89543-3_22MaRDI QIDQ2695293

Ankush Acharyya, Maarten Löffler, Ramesh K. Jallu, Vahideh Keikha, Maria Saumell

Publication date: 30 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_22

zbMATH Keywords

algorithms; computational complexity; imprecise points; color spanning circle

Mathematics Subject Classification ID

68Rxx: Discrete mathematics in relation to computer science

Cites Work

• Unnamed Item
• The directed Hausdorff distance between imprecise point sets
• Dispersion in disks
• 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 bounding box, smallest diameter, and related problems on imprecise points
• On some geometric problems of color-spanning sets
• Computing the Smallest Color-Spanning Axis-Parallel Square
• Shortest Color-Spanning Intervals
• 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