Introduction to algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing
Approximation algorithms for some optimum communication spanning tree problems
Discrete Applied Mathematics
Approximation algorithms for the shortest total path length spanning tree problem
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of minimizing certain cost metrics for k-source spanning trees
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
Multi-source spanning trees: algorithms for minimizing source eccentricities
Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Approximation algorithms for the optimal p-source communication spanning tree
Discrete Applied Mathematics
An efficient phase detector connection structure for the skew synchronization system
Proceedings of the 47th Design Automation Conference
| Hi-index | 0.04 |
Let G = (V,E,w) be an undirected graph with positive edge lengths and S ⊂ V a set of k specified sources. The k-source maximum eccentricity spanning tree is a spanning tree T minimizing the maximum distance from a source to a vertex, i.e., maxs∈S {maxv∈V{dT(s,v)}, where dT(s,v) is the length of the path between s and v in T. In this paper, we propose an O(|V|2 log |V| + |V| |E|) time algorithm, which improves the previous result on the problem.