The maximum labeled path problem
type: Item
instance of: scholarly article
title: The maximum labeled path problem
zbMATH Open document ID: 1360.68901
author: Basile Couëtoux
author: Elie Nakache
author: Yann Vaxès
published in: Algorithmica
publication date: 2017-05-11T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6714293
zbMATH Keywords: graph algorithm
zbMATH Keywords: approximation algorithm
zbMATH Keywords: hardness of approximation
zbMATH Keywords: labels
MaRDI profile type: Publication
full work available at URL: s00453-016-0155-6
OpenAlex ID: W2377915845
cites work: Q4354373
cites work: Spanning trees with many or few colors in edge-colored graphs
cites work: Q4659605
cites work: Local search for the minimum label spanning tree problem with bounded color classes.
cites work: Labeled traveling salesman problems: complexity and approximation
cites work: Approximation algorithms and hardness results for labeled connectivity problems
cites work: The Complexity of Bottleneck Labeled Graph Problems
cites work: Some optimal inapproximability results
cites work: On the minimum label spanning tree problem
cites work: The labeled perfect matching in bipartite graphs
DOI: 10.1007/S00453-016-0155-6
description: scientific article; zbMATH DE number 6714293