Efficient algorithms for a constrained k-tree core problem in a tree network

Authors:
Biing-Feng Wang;Shietung Peng;Hong-Yi Yu;Shan-Chyun Ku
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China;Faculty of Computer and Information Sciences, Hosei University, Tokyo 184-8584, Japan;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China;Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China
Venue:
Journal of Algorithms
Year:
2006

Citing 9
Cited 0

The multicast policy and its relationship to replicated data placement

ACM Transactions on Database Systems (TODS)
Algorithms for a core and k-tree core of a tree

Journal of Algorithms
On the conditional p-median problem

Computers and Operations Research
A linear time algorithm for finding a k-tree core

Journal of Algorithms
Efficient parallel algorithms for optimally locating a path and a tree of a specified length in a weighted tree network

Journal of Algorithms
Cost-Optimal Parallel Algorithms for the Tree Bisector and Related Problems

IEEE Transactions on Parallel and Distributed Systems
Finding a 2-Core of a Tree in Linear Time

SIAM Journal on Discrete Mathematics
The Cent-dian Path Problem on Tree Networks

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Efficient Algorithms for Two Generalized 2-Median Problems on Trees

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let T=(V,E) be a free tree in which each vertex has a weight and each edge has a length. Let n=|V|. Given T and parameters k and l, a (k,l)-tree core is a subtree X of T with diameter =