Path equipartition in the Chebyshev norm

DOI10.1016/S0377-2217(99)00267-2zbMath0961.90121MaRDI QIDQ1569949

Bruno Simeone, Marco Liverani, Giovanni Storchi, Aurora Morgana

Publication date: 20 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

optimizationpartitioninggraph theory

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

Improved algorithms for path partition and related problems ⋮ Minimum \(L_k\) path partitioning-an illustration of the Monge property

Cites Work

• Unnamed Item
• Clustering on trees
• Most uniform path partitioning and its use in image processing
• The shifting algorithm technique for the partitioning of trees
• Partitioning a matrix to minimize the maximum cost
• Shifting algorithms for tree partitioning with general weighting functions
• Max-Min Tree Partitioning
• A Shifting Algorithm for Min-Max Tree Partitioning
• Max-min partitioning of grid graphs into connected components
• Fair dissections of spiders, worms, and caterpillars

This page was built for publication: Path equipartition in the Chebyshev norm