scientific article; zbMATH DE number 3980505
From MaRDI portal
Publication:3745296
zbMATH Open0606.68060MaRDI QIDQ3745296FDOQ3745296
Authors: Giulia Galbiati, Francesco Maffioli, Paolo M. Camerini 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (19)
- On the approximability of some maximum spanning tree problems
- Optimality conditions in preference-based spanning tree problems
- The multi-weighted spanning tree problem
- On the approximability of some Maximum Spanning Tree Problems
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Complexity of the multiobjective minimum weight minimum stretch spanner problem
- On some multicriteria arborescence problems: Complexity and algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Most and least uniform spanning trees
- The complexity of spanning tree problems involving graphical indices
- A survey of recent developments in multiobjective optimization
- On spanning tree problems with multiple objectives
- Combining linear and nonlinear objectives in spanning tree problems
- The complexity of minimum ratio spanning tree problems
- The Weighted Spanning Tree Constraint Revisited
- A Survey on Multiple Objective Minimum Spanning Tree Problems
- Complexity of spanning tree problems: Part I
- Complexities of some interesting problems on spanning trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745296)
