Computing minimum diameter color-spanning sets

DOI10.1007/978-3-642-14553-7_27MaRDI QIDQ3587360zbMATH OpenOpenAlexFDO

Authors Rudolf Fleischer, Xiaoming 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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Minimum diameter color-spanning sets revisited
• Approximation algorithms for color spanning diameter
• On some geometric problems of color-spanning sets
• On some geometric problems of color-spanning sets
• On some proximity problems of colored sets

Cited in

(18)

• Approximation algorithms for color spanning diameter
• Computing minimum diameter color-spanning sets is hard
• Minimum diameter color-spanning sets revisited
• On some matching problems under the color-spanning model
• Expected computations on color spanning sets
• On some geometric problems of color-spanning sets
• Efficiently approximating color-spanning balls
• On some proximity problems of colored sets
• On some geometric problems of color-spanning sets
• Algorithms for interval structures with applications
• An Approximation Algorithm for the Smallest Color-Spanning Circle Problem
• The approximation algorithms for a class of multiple-choice problem
• Algorithms for interval structures with applications
• Minimum-diameter covering problems
• On the fixed-parameter tractability of some matching problems under the color-spanning model
• Online \(k\)-color spanning disk problems
• The 2-mixed-center color spanning problem
• Shortest color-spanning intervals

This page was built for publication: Computing minimum diameter color-spanning sets

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