Minimum diameter color-spanning sets revisited

DOI10.1016/J.DISOPT.2019.07.001MaRDI QIDQ2010932zbMATH OpenOpenAlexFDO

Authors 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)

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

Cites work

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

Cited in

(14)

• On the \(k\)-colored rainbow sets in fixed dimensions
• Dispersing and grouping points on planar segments
• Computing minimum diameter color-spanning sets
• Unit covering in color-spanning set model
• Rainbow polygons for colored point sets in the plane
• Online \(k\)-color spanning disk problems
• On some matching problems under the color-spanning model
• Arbitrary-oriented color spanning region for line segments
• Tight approximation bounds for connectivity with a color-spanning set
• On some geometric problems of color-spanning sets
• Approximation algorithms for color spanning diameter
• On some geometric problems of color-spanning sets
• On the fixed-parameter tractability of some matching problems under the color-spanning model
• On some proximity problems of colored sets

Describes a project that uses

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)