Computing largest minimum color-spanning intervals of imprecise points

DOI10.1007/978-3-031-55598-5_6MaRDI QIDQ6547918

Vahideh Keikha, Maria Saumell, Rodrigo I. Silveira, Ankush Acharyya

Publication date: 31 May 2024

zbMATH Keywords

algorithmsimprecise pointscolor-spanning interval

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Algorithms for interval structures with applications
• Largest and smallest convex hulls for imprecise points
• Ray shooting, depth orders and hidden surface removal
• Dispersing points on intervals
• Systems of distant representatives
• Computing minimum diameter color-spanning sets is hard
• Computing \(k\)-centers of uncertain points on a real line
• Minimum color spanning circle of imprecise points
• Largest bounding box, smallest diameter, and related problems on imprecise points
• SMALLEST COLOR-SPANNING OBJECT REVISITED

This page was built for publication: Computing largest minimum color-spanning intervals of imprecise points