On some multicriteria arborescence problems: Complexity and algorithms

DOI10.1016/0166-218X(95)00035-PMaRDI QIDQ1917271zbMATH OpenOpenAlexFDO

Authors Mauro Dell'Amico, Francesco Maffioli

Publication date 7 July 1996

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(95)00035-p

zbMATH Keywords

digraph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 7692724
• Publication:4733693
• Arborescence optimization problems solvable by Edmonds' algorithm
• Combining linear and nonlinear objectives in spanning tree problems

Cites work

• A note on finding optimum branchings
• A note on two problems in connexion with graphs
• Complexity of spanning tree problems: Part I
• Finding optimum branchings
• scientific article; zbMATH DE number 3980505 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the complexity of finding multi-constrained spanning trees
• Optimum branchings
• The Min-Max Spanning Tree Problem and some extensions
• The NP-completeness column: An ongoing guide

Cited in

(6)

• Arborescence optimization problems solvable by Edmonds' algorithm
• Kruskal with embedded c-semirings to solve MST problems with partially-ordered costs
• Local search algorithms for political districting
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• A multi-objective perspective on the cable-trench problem

This page was built for publication: On some multicriteria arborescence problems: Complexity and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917271)