Computing Minimum Diameter Color-Spanning Sets
From MaRDI portal
Publication:3587360
DOI10.1007/978-3-642-14553-7_27zbMath1288.68115OpenAlexW1522294718MaRDI QIDQ3587360
Rudolf Fleischer, Xiao-Ming Xu
Publication date: 7 September 2010
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14553-7_27
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)
Related Items (14)
On some geometric problems of color-spanning sets ⋮ The approximation algorithms for a class of multiple-choice problem ⋮ An Approximation Algorithm for the Smallest Color-Spanning Circle Problem ⋮ Algorithms for interval structures with applications ⋮ Online \(k\)-color spanning disk problems ⋮ Shortest color-spanning intervals ⋮ Computing minimum diameter color-spanning sets is hard ⋮ On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model ⋮ On Some Geometric Problems of Color-Spanning Sets ⋮ Algorithms for Interval Structures with Applications ⋮ Minimum diameter color-spanning sets revisited ⋮ On some matching problems under the color-spanning model ⋮ Expected computations on color spanning sets ⋮ On Some Proximity Problems of Colored Sets
This page was built for publication: Computing Minimum Diameter Color-Spanning Sets
