Minimum diameter color-spanning sets revisited
type: Item
instance of: scholarly article
title: Minimum diameter color-spanning sets revisited
zbMATH Open document ID: 1506.90231
author: Jonas Pruente
published in: Discrete Optimization
publication date: 2019-11-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7138073
zbMATH Keywords: minimum diameter
zbMATH Keywords: color-spanning sets
zbMATH Keywords: multicolored clique
zbMATH Keywords: W-hierarchy
zbMATH Keywords: approximation algorithms
zbMATH Keywords: IQP formulation
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.disopt.2019.07.001
OpenAlex ID: W2958935978
cites work: On the minimum diameter spanning tree problem
cites work: Minimum Diameter Spanning Trees and Related Problems
cites work: Approximate minimum diameter
cites work: On some matching problems under the color-spanning model
cites work: On some geometric problems of color-spanning sets
cites work: Computing Minimum Diameter Color-Spanning Sets
cites work: Approximation algorithms for color spanning diameter
cites work: On the parameterized complexity of multiple-interval graph problems
DOI: 10.1016/J.DISOPT.2019.07.001
description: scientific article; zbMATH DE number 7138073