Unit covering in color-spanning set model

DOI10.1007/978-3-319-15612-5_5MaRDI QIDQ5176571zbMATH OpenOpenAlexFDO

Authors Ehsan Emamjomeh-Zadeh, Mohammad Ghodsi, Hamid Homapour, Masoud Seddighin

Publication date 27 February 2015

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-15612-5_5

zbMATH Keywords

approximation algorithmcolor-spanning setcomputational complexitycomputational geometryunit covering

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• The approximation algorithms for a class of multiple-choice problem
• On some geometric problems of color-spanning sets
• Minimum diameter color-spanning sets revisited
• On some geometric problems of color-spanning sets
• Geometric red-blue set cover for unit squares and related problems

Cited in

(3)

• Selecting and covering colored points
• On approximability of minimum color-spanning ball in high dimensions
• The approximation algorithms for a class of multiple-choice problem

This page was built for publication: Unit covering in color-spanning set model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176571)