Path equipartition in the Chebyshev norm

DOI10.1016/S0377-2217(99)00267-2MaRDI QIDQ1569949zbMATH OpenFDO

Authors Marco Liverani, Aurora Morgana, Bruno Simeone, G. Storchi

Publication date 20 September 2000

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

Full work available at URL https://doi.org/10.1016/S0377-2217(99)00267-2

zbMATH Keywords

graph theoryoptimizationpartitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3972869
• Improved algorithms for path partition and related problems
• Most uniform path partitioning and its use in image processing
• Uniform and most uniform partitions of trees
• On a 2-dimensional equipartition problem

Cites work

• A Shifting Algorithm for Min-Max Tree Partitioning
• Clustering on trees
• Fair dissections of spiders, worms, and caterpillars
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Max-min partitioning of grid graphs into connected components
• Max-Min Tree Partitioning
• Most uniform path partitioning and its use in image processing
• Partitioning a matrix to minimize the maximum cost
• Shifting algorithms for tree partitioning with general weighting functions
• The shifting algorithm technique for the partitioning of trees

Cited in

(3)

• Most uniform path partitioning and its use in image processing
• Improved algorithms for path partition and related problems
• Minimum \(L_k\) path partitioning-an illustration of the Monge property

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569949)