Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
type: Item
instance of: scholarly article
title: Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks
zbMATH Open document ID: 1390.90552
author: Rafael Santos
author: Alessandro Andrioni
author: Andre C. Drummond
author: Eduardo C. Xavier
published in: Journal of Combinatorial Optimization
publication date: 2017-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6687860
zbMATH Keywords: minimum paths in coloured graphs
zbMATH Keywords: NP-hardness
zbMATH Keywords: heuristics
zbMATH Keywords: WDM networks
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10878-016-0003-2
OpenAlex ID: W2312417503
cites work: Covering Pairs in Directed Acyclic Graphs
cites work: Maximum disjoint paths on edge-colored graphs: approximability and tractability
cites work: Line planning, path constrained network flow and inapproximability
cites work: Some extremal results on the colorful monochromatic vertex-connectivity of a graph
cites work: A note on two problems in connexion with graphs
cites work: Benchmarking optimization software with performance profiles.
cites work: On the complexity of path problems in properly colored directed graphs
cites work: Q4550357
cites work: Reducibility among Combinatorial Problems
cites work: On Path Cover Problems in Digraphs and Applications to Program Testing
cites work: Rainbow connections of graphs: a survey
cites work: On the strong rainbow connection of a graph
cites work: A survey on vertex coloring problems
cites work: Q4247451
cites work: Disjoint paths in a network
cites work: On the maximum disjoint paths problem on edge-colored graphs
cites work: A note on a maximum \(k\)-subset intersection problem
DOI: 10.1007/S10878-016-0003-2
description: scientific article; zbMATH DE number 6687860