On some multicriteria arborescence problems: Complexity and algorithms
From MaRDI portal
Publication:1917271
DOI10.1016/0166-218X(95)00035-PzbMath0854.68042OpenAlexW2090155298MaRDI QIDQ1917271
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Local search algorithms for political districting, Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs, A Survey on Multiple Objective Minimum Spanning Tree Problems
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Complexity of spanning tree problems: Part I
- On the complexity of finding multi-constrained spanning trees
- The Min-Max Spanning Tree Problem and some extensions
- A note on finding optimum branchings
- Finding optimum branchings
- Optimum branchings
- The NP-completeness column: An ongoing guide