Minimum color spanning circle in imprecise setup

DOI10.1007/978-3-030-89543-3_22MaRDI QIDQ2695293zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmscomputational complexityimprecise pointscolor spanning circle

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 1875422 (Why is no real title available?)
• An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
• Approximation algorithms for spreading points
• Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets
• Computing minimum diameter color-spanning sets is hard
• Computing the smallest color-spanning axis-parallel square
• Dispersion in disks
• Geometric avatar problems
• Largest bounding box, smallest diameter, and related problems on imprecise points
• Minimum width color spanning annulus
• NP-Completeness of Spreading Colored Points
• On some geometric problems of color-spanning sets
• Planar Formulae and Their Uses
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Shortest color-spanning intervals
• Systems of distant representatives
• TSP with neighborhoods of varying size
• The Problem of Compatible Representatives
• The directed Hausdorff distance between imprecise point sets
• The upper envelope of Voronoi surfaces and its applications

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)