Minimum diameter color-spanning sets revisited

DOI10.1016/J.DISOPT.2019.07.001zbMATH Open1506.90231OpenAlexW2958935978MaRDI QIDQ2010932FDOQ2010932

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

Recommendations

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

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)

Cites Work

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

Cited In (6)

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

Uses Software

• CPLEX

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

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