Continuous bottleneck tree partitioning problems (Q1827846): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Arie Tamir / rank
Normal rank
 
Property / author
 
Property / author: Arie Tamir / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2003.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992353374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning of biweighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifting algorithms for tree partitioning with general weighting functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shifting Algorithm for Min-Max Tree Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shifting algorithm for continuous tree partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location on Tree Networks: <i>P</i>-Centre and <i>n</i>-Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O ( ( n\log p )^2 )$ Algorithm for the Continuous <i>p</i>-Center Problem on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding kth paths and p-centers by generating and searching good data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most uniform path partitioning and its use in image processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient search for rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Min Tree Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient implementation of a shifting algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational search / rank
 
Normal rank

Latest revision as of 18:28, 6 June 2024

scientific article
Language Label Description Also known as
English
Continuous bottleneck tree partitioning problems
scientific article

    Statements

    Continuous bottleneck tree partitioning problems (English)
    0 references
    0 references
    0 references
    6 August 2004
    0 references
    Tree partitioning
    0 references
    Continuous \(p\)-center problems
    0 references
    Bottleneck problems
    0 references
    Parametric search
    0 references

    Identifiers