Continuous bottleneck tree partitioning problems
type: Item
instance of: scholarly article
title: Continuous bottleneck tree partitioning problems
zbMATH Open document ID: 1077.68024
author: Nir Halman
author: Arie Tamir
published in: Discrete Applied Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2083777
zbMATH Keywords: Tree partitioning
zbMATH Keywords: Continuous \(p\)-center problems
zbMATH Keywords: Bottleneck problems
zbMATH Keywords: Parametric search
MaRDI profile type: Publication
full work available at URL: j.dam.2003.04.002
OpenAlex ID: W1992353374
cites work: Partitioning of biweighted trees
cites work: Shifting algorithms for tree partitioning with general weighting functions
cites work: A Shifting Algorithm for Min-Max Tree Partitioning
cites work: A shifting algorithm for continuous tree partitioning
cites work: Time bounds for selection
cites work: Location on Tree Networks: P-Centre and n-Dispersion Problems
cites work: An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Q3138951
cites work: Q4037428
cites work: Finding kth paths and p-centers by generating and searching good data structures
cites work: Q4198056
cites work: Most uniform path partitioning and its use in image processing
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: New Results on the Complexity of p-Centre Problems
cites work: Efficient search for rationals
cites work: Max-Min Tree Partitioning
cites work: Efficient implementation of a shifting algorithm
cites work: Rational search
DOI: 10.1016/J.DAM.2003.04.002
description: scientific article; zbMATH DE number 2083777