The rainbow spanning forest problem
type: Item
instance of: scholarly article
title: The rainbow spanning forest problem
zbMATH Open document ID: 1398.90132
author: Francesco Carrabs
author: C. Cerrone
author: Raffaele Cerulli
author: Selene Silvestri
published in: Soft Computing
publication date: 2018-10-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6960446
zbMATH Keywords: graph theory
zbMATH Keywords: edge-colored graph
zbMATH Keywords: rainbow components
zbMATH Keywords: multi-start scheme
zbMATH Keywords: heterochromatic components
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s00500-017-2540-8
OpenAlex ID: W2595243011
cites work: Multicolored trees in complete graphs
cites work: On proper-path colorings in graphs
cites work: Multicolored forests in complete bipartite graphs
cites work: Q4952637
cites work: On the complexity of rainbow spanning forest problem
cites work: The labeled maximum matching problem
cites work: Edge-disjoint rainbow spanning trees in complete graphs
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: Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
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: Solution of a Large-Scale Traveling-Salesman Problem
cites work: A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
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: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
cites work: The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
cites work: Optimal pathway reconstruction on 3D NMR maps
cites work: The Colorful Traveling Salesman Problem
DOI: 10.1007/S00500-017-2540-8
description: scientific article; zbMATH DE number 6960446