Computing minimum diameter color-spanning sets is hard
From MaRDI portal
Publication:1944200
DOI10.1016/j.ipl.2011.07.015zbMath1260.68153OpenAlexW2054933178MaRDI QIDQ1944200
Rudolf Fleischer, Xiao-Ming Xu
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.07.015
Related Items
On the \(k\)-colored rainbow sets in fixed dimensions, The approximation algorithms for a class of multiple-choice problem, Minimum color spanning circle of imprecise points, On approximability of minimum color-spanning ball in high dimensions, Online \(k\)-color spanning disk problems, Shortest color-spanning intervals, Minimum color spanning circle in imprecise setup, Approximation algorithms for color spanning diameter, On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model, Rainbow polygons for colored point sets in the plane, A fully polynomial time approximation scheme for the smallest diameter of imprecise points, On some matching problems under the color-spanning model
Cites Work
