Algorithms for uniform centered partitions of trees
type: Item
instance of: scholarly article
title: Algorithms for uniform centered partitions of trees
zbMATH Open document ID: 1356.05110
author: Isabella Lari
author: Justo Puerto
author: Federica Ricca
author: Andrea Scozzari
publication date: 2017-02-14T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6684434
zbMATH Keywords: tree partitioning
zbMATH Keywords: centered partitions
zbMATH Keywords: flat costs
zbMATH Keywords: min-max criteria
zbMATH Keywords: uniform partitions
MaRDI profile type: Publication
full work available at URL: j.endm.2016.10.010
OpenAlex ID: W2552622987
cites work: Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs
cites work: The shifting algorithm technique for the partitioning of trees
cites work: Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria
cites work: New Results on the Complexity of p-Centre Problems
cites work: Max-Min Tree Partitioning
cites work: Efficient implementation of a shifting algorithm
DOI: 10.1016/J.ENDM.2016.10.010
description: scientific article; zbMATH DE number 6684434