On the complexity of rainbow spanning forest problem
type: Item
instance of: scholarly article
title: On the complexity of rainbow spanning forest problem
zbMATH Open document ID: 1400.90256
author: Francesco Carrabs
author: C. Cerrone
author: Raffaele Cerulli
author: Selene Silvestri
published in: Optimization Letters
publication date: 2018-05-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6875319
zbMATH Keywords: graph theory
zbMATH Keywords: edge-colored graph
zbMATH Keywords: rainbow components
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: s11590-017-1161-6
OpenAlex ID: W2664277112
cites work: Spanning trees with many or few colors in edge-colored graphs
cites work: Multicolored forests in complete bipartite graphs
cites work: Q4952637
cites work: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
cites work: The labeled maximum matching problem
cites work: Carousel greedy: a generalized greedy algorithm with applications in optimization
cites work: OMEGA one multi ethnic genetic approach
cites work: Vehicle-ID sensor location for route flow recognition: models and algorithms
cites work: The minimum labeling spanning trees
cites work: Variable neighbourhood search for the minimum labelling Steiner tree problem
cites work: Discrete particle swarm optimization for the minimum labelling Steiner tree problem
cites work: A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
cites work: Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
cites work: On the minimum label spanning tree problem
cites work: On the minimum monochromatic or multicolored subgraph partition problems
cites work: The Rainbow Cycle Cover Problem
cites work: The Colorful Traveling Salesman Problem
DOI: 10.1007/S11590-017-1161-6
description: scientific article; zbMATH DE number 6875319