Minimum diameter color-spanning sets revisited

DOI10.1016/j.disopt.2019.07.001zbMath1506.90231OpenAlexW2958935978MaRDI QIDQ2010932

Jonas Pruente

Publication date: 28 November 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2019.07.001

zbMATH Keywords

approximation algorithmsW-hierarchyminimum diametermulticolored cliquecolor-spanning setsIQP formulation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

On the \(k\)-colored rainbow sets in fixed dimensions ⋮ Online \(k\)-color spanning disk problems ⋮ Arbitrary-oriented color spanning region for line segments ⋮ Dispersing and grouping points on planar segments ⋮ Rainbow polygons for colored point sets in the plane

Uses Software

• CPLEX

Cites Work

• On the minimum diameter spanning tree problem
• On the parameterized complexity of multiple-interval graph problems
• Approximation algorithms for color spanning diameter
• On some matching problems under the color-spanning model
• On some geometric problems of color-spanning sets
• Approximate minimum diameter
• Computing Minimum Diameter Color-Spanning Sets
• Minimum Diameter Spanning Trees and Related Problems

This page was built for publication: Minimum diameter color-spanning sets revisited