The approximation algorithms for a class of multiple-choice problem

DOI10.1016/j.tcs.2016.06.038zbMath1353.68283OpenAlexW2468013557MaRDI QIDQ344788

Yin Wang, Yin-Feng Xu

Publication date: 24 November 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.038

zbMATH Keywords

approximation algorithmcomputational geometrycolor-spanning objectsthe smallest enclosing problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On enclosing k points by a circle
• Shortest color-spanning intervals
• Fast computation of smallest enclosing circle with center on a query line segment
• Finding minimum area \(k\)-gons
• Iterated nearest neighbors and finding minimal polytopes
• Computing minimum diameter color-spanning sets is hard
• Bichromatic 2-center of pairs of points
• On some geometric problems of color-spanning sets
• On the Discrete Unit Disk Cover Problem
• Computing Minimum Diameter Color-Spanning Sets
• Sets with No Empty Convex 7-Gons
• Minimum-diameter covering problems
• Unit Covering in Color-Spanning Set Model

This page was built for publication: The approximation algorithms for a class of multiple-choice problem