Continuous bottleneck tree partitioning problems

DOI10.1016/j.dam.2003.04.002zbMath1077.68024OpenAlexW1992353374MaRDI QIDQ1827846

Nir Halman, Arie Tamir

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.04.002

zbMATH Keywords

Parametric searchBottleneck problemsContinuous \(p\)-center problemsTree partitioning

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

New Upper Bounds on Continuous Tree Edge-Partition Problem ⋮ Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient implementation of a shifting algorithm
• Rational search
• Efficient search for rationals
• Time bounds for selection
• Most uniform path partitioning and its use in image processing
• A shifting algorithm for continuous tree partitioning
• Shifting algorithms for tree partitioning with general weighting functions
• New Results on the Complexity of p-Centre Problems
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Combinatorial Optimization with Rational Objective Functions
• Max-Min Tree Partitioning
• A Shifting Algorithm for Min-Max Tree Partitioning
• An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• Partitioning of biweighted trees
• Slowing down sorting networks to obtain faster sorting algorithms
• Finding kth paths and p-centers by generating and searching good data structures

This page was built for publication: Continuous bottleneck tree partitioning problems