A tight bound on the min-ratio edge-partitioning problem of a tree
From MaRDI portal
Publication:608252
DOI10.1016/J.DAM.2010.05.014zbMATH Open1215.05030OpenAlexW2060058676MaRDI QIDQ608252FDOQ608252
Authors: An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, Kun-Mao Chao 
Publication date: 25 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.05.014
Recommendations
- On the uniform edge-partition of a tree
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
- New Upper Bounds on Continuous Tree Edge-Partition Problem
- A note on the minimum bounded edge-partition of a tree
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A Linear Tree Partitioning Algorithm
- Most uniform path partitioning and its use in image processing
- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size
- Title not available (Why is that?)
- Finding kth paths and p-centers by generating and searching good data structures
- Max-Min Tree Partitioning
- Spanning Trees and Optimization Problems
- A Shifting Algorithm for Min-Max Tree Partitioning
- A shifting algorithm for continuous tree partitioning
- On the uniform edge-partition of a tree
- New Upper Bounds on Continuous Tree Edge-Partition Problem
- Shifting algorithms for tree partitioning with general weighting functions
- An algorithm for partitioning trees augmented with sibling edges
Cited In (11)
- An overview of graph covering and partitioning
- New Upper Bounds on Continuous Tree Edge-Partition Problem
- A note on the minimum bounded edge-partition of a tree
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
- Approximate envy-freeness in graphical cake cutting
- Title not available (Why is that?)
- Tree edge decomposition with an application to minimum ultrametric tree approximation
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
- On a tree-cutting problem of P. Ash
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two
- On the uniform edge-partition of a tree
This page was built for publication: A tight bound on the min-ratio edge-partitioning problem of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q608252)
