On the uniform edge-partition of a tree

Authors:
Bang Ye Wu;Hung-Lung Wang;Shih Ta Kuan;Kun-Mao Chao
Affiliations:
Department of Computer Science and Information Engineering, Shu-Te University, YenChau, KaoShiung 824, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taiwan University, Taipei 106, Taiwan, ROC;Department of Computer Science and Information Engineering, Shu-Te University, YenChau, KaoShiung 824, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taiwan University, Taipei 106, Taiwan, ROC and Graduate Institute of Networking and Multimedia, National Taiwan University, Tai ...
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 12
Cited 3

Multiple alignment, communication cost, and graph matching

SIAM Journal on Applied Mathematics
Most uniform path partitioning and its use in image processing

Discrete Applied Mathematics - Special issue: combinatorial structures and algorithms
The shifting algorithm technique for the partitioning of trees

Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree

Discrete Applied Mathematics
(p-1)/(p+1)-approximate algorithms for p-traveling salemen problems on a tree with minmax objective

Discrete Applied Mathematics
Approximation algorithms for multiple sequence alignment

Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Max-Min Tree Partitioning

Journal of the ACM (JACM)
A Shifting Algorithm for Min-Max Tree Partitioning

Journal of the ACM (JACM)
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

SIAM Journal on Computing
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Note: A note on the minimum bounded edge-partition of a tree

Discrete Applied Mathematics
A tight bound on the min-ratio edge-partitioning problem of a tree

Discrete Applied Mathematics
A linear-time algorithm for finding an edge-partition with max-min ratio at most two

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k=