Pages that link to "Item:Q1145635"
From MaRDI portal
The following pages link to Complexity of spanning tree problems: Part I (Q1145635):
Displaying 18 items.
- The matroidal knapsack: A class of (often) well-solvable problems (Q797497) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- On the complexity of finding multi-constrained spanning trees (Q1171508) (← links)
- Topological design of telecommunication networks --- local access design methods (Q1179728) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- In memoriam Paolo M. Camerini (Q1803668) (← links)
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253) (← links)
- On some multicriteria arborescence problems: Complexity and algorithms (Q1917271) (← links)
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← links)
- Graphical-structure-based models for routing problems (Q3799805) (← links)
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem (Q4008469) (← links)
- The Bounded Path Tree Problem (Q4750668) (← links)
- On the approximability of some maximum spanning tree problems (Q5096340) (← links)
- A uniform self-stabilizing minimum diameter spanning tree algorithm (Q6084561) (← links)
