New Upper Bounds on Continuous Tree Edge-Partition Problem

DOI10.1007/978-3-540-68880-8_6zbMath1143.05330OpenAlexW1577506113MaRDI QIDQ3511413

Robert Benkoczi, Qiaosheng Shi, Binay K. Bhattacharya

Publication date: 10 July 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68880-8_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A tight bound on the min-ratio edge-partitioning problem of a tree ⋮ A linear-time algorithm for finding an edge-partition with max-min ratio at most two

Cites Work

• Time bounds for selection
• Continuous bottleneck tree partitioning problems
• Priority Search Trees
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Parallelism in Comparison Problems
• Slowing down sorting networks to obtain faster sorting algorithms

This page was built for publication: New Upper Bounds on Continuous Tree Edge-Partition Problem