Pages that link to "Item:Q5433194"
From MaRDI portal
The following pages link to Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194):
Displaying 9 items.
- Algorithms for uniform centered partitions of trees (Q510918) (← links)
- Political districting: From classical models to recent approaches (Q657583) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- On finding connected balanced partitions of trees (Q2028065) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Goal programming approach for political districting in Santa Catarina state: Brazil (Q2178309) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194) (← links)