Path equipartition in the Chebyshev norm
type: Item
instance of: scholarly article
title: Path equipartition in the Chebyshev norm
zbMATH Open document ID: 0961.90121
DOI: 10.1016/S0377-2217(99)00267-2
author: Marco Liverani
author: Aurora Morgana
author: Bruno Simeone
author: G. Storchi
published in: European Journal of Operational Research
publication date: 2000-09-20T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1471191
zbMATH Keywords: graph theory
zbMATH Keywords: optimization
zbMATH Keywords: partitioning
MaRDI profile type: Publication
cites work: Max-min partitioning of grid graphs into connected components
cites work: Shifting algorithms for tree partitioning with general weighting functions
cites work: The shifting algorithm technique for the partitioning of trees
cites work: A Shifting Algorithm for Min-Max Tree Partitioning
cites work: Fair dissections of spiders, worms, and caterpillars
cites work: Q4198056
cites work: Most uniform path partitioning and its use in image processing
cites work: Clustering on trees
cites work: Partitioning a matrix to minimize the maximum cost
cites work: Max-Min Tree Partitioning
description: scientific article; zbMATH DE number 1471191