Pages that link to "Item:Q1421460"
From MaRDI portal
The following pages link to On the complexity of graph tree partition problems. (Q1421460):
Displayed 6 items.
- Another greedy heuristic for the constrained forest problem (Q813973) (← links)
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← links)
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326) (← links)
- A subexponential algorithm for the coloured tree partition problem (Q2370434) (← links)
- A class of heuristics for the constrained forest problem (Q2581555) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)