Approximation algorithms for color spanning diameter

DOI10.1016/j.ipl.2018.01.007zbMath1476.68306OpenAlexW2792806626MaRDI QIDQ1708269

Mohammad Reza Kazemi, Ali Mohades, Payam Khanteimouri

Publication date: 5 April 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.01.007

zbMATH Keywords

diameterapproximation algorithmsinapproximabilitycolor spanning set

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (5)

On the \(k\)-colored rainbow sets in fixed dimensions ⋮ On approximability of minimum color-spanning ball in high dimensions ⋮ Online \(k\)-color spanning disk problems ⋮ Minimum diameter color-spanning sets revisited ⋮ A fully polynomial time approximation scheme for the smallest diameter of imprecise points

Cites Work

• Unnamed Item
• Efficiently approximating color-spanning balls
• Computing minimum diameter color-spanning sets is hard
• Approximate minimum diameter
• Optimal core-sets for balls
• Approximating extent measures of points

This page was built for publication: Approximation algorithms for color spanning diameter