On some multicriteria arborescence problems: Complexity and algorithms
type: Item
instance of: scholarly article
title: On some multicriteria arborescence problems: Complexity and algorithms
zbMATH Open document ID: 0854.68042
DOI: 10.1016/0166-218X(95)00035-P
author: Mauro Dell'Amico
author: Francesco Maffioli
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 897380
zbMATH Keywords: digraph
MaRDI profile type: Publication
cites work: The Min-Max Spanning Tree Problem and some extensions
cites work: Complexity of spanning tree problems: Part I
cites work: On the complexity of finding multi-constrained spanning trees
cites work: Q3745296
cites work: A note on two problems in connexion with graphs
cites work: Optimum branchings
cites work: Q4198056
cites work: The NP-completeness column: An ongoing guide
cites work: A note on finding optimum branchings
cites work: Finding optimum branchings
full work available at URL: 0166-218x(95)00035-p
OpenAlex ID: W2090155298
description: scientific article; zbMATH DE number 897380