A shifting algorithm for continuous tree partitioning

Authors:
Ronald Becker;Bruno Simeone;Yen-I Chiang
Affiliations:
Department of Mathematics, University of Cape Town, Rondebosch 7700, South Africa;Dipartimento di Statistica, Probabilitá e Statistiche Applicate, Universitá "La Sapienza", P. le Aldo Moro 5, I-00185 Rome, Italy;Department of Mathematics, University of Cape Town, Rondebosch 7700, South Africa
Venue:
Theoretical Computer Science
Year:
2002

Citing 3
Cited 4

Most uniform path partitioning and its use in image processing

Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
Max-Min Tree Partitioning

Journal of the ACM (JACM)
A Shifting Algorithm for Min-Max Tree Partitioning

Journal of the ACM (JACM)

Continuous bottleneck tree partitioning problems

Discrete Applied Mathematics
Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches

Discrete Applied Mathematics
A tight bound on the min-ratio edge-partitioning problem of a tree

Discrete Applied Mathematics
A linear-time algorithm for finding an edge-partition with max-min ratio at most two

Discrete Applied Mathematics

Quantified Score

Hi-index	5.23

Visualization

Abstract