Pages that link to "Item:Q1850820"
From MaRDI portal
The following pages link to A shifting algorithm for continuous tree partitioning (Q1850820):
Displayed 6 items.
- A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- Partitioning a weighted tree into subtrees with weights in a given range (Q2428691) (← links)
- Multi-period maintenance scheduling of tree networks with minimum flow disruption (Q5198690) (← links)