bang-ye-wu documents

Light graphs with small routing cost
Documents Light graphs with small routing cost
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
Documents A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
Approximation algorithms for the optimal p-source communication spanning tree
Documents Approximation algorithms for the optimal p-source communication spanning tree
Exact algorithms for the minimum latency problem
Documents Exact algorithms for the minimum latency problem
On the intercluster distance of a tree metric
Documents On the intercluster distance of a tree metric
An analysis of the LPT algorithm for the max–min and the min–ratio partition problems
Documents An analysis of the LPT algorithm for the max–min and the min–ratio partition problems
Polynomial time algorithms for some minimum latency problems
Documents Polynomial time algorithms for some minimum latency problems
An efficient algorithm for the length-constrained heaviest path problem on a tree
Documents An efficient algorithm for the length-constrained heaviest path problem on a tree
Approximation algorithms for the shortest total path length spanning tree problem
Documents Approximation algorithms for the shortest total path length spanning tree problem
Approximation algorithms for some optimum communication spanning tree problems
Documents Approximation algorithms for some optimum communication spanning tree problems
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
Documents A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
An improved algorithm for the k-source maximum eccentricity spanning trees
Documents An improved algorithm for the k-source maximum eccentricity spanning trees
Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
Documents Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices
On the maximum disjoint paths problem on edge-colored graphs
Documents On the maximum disjoint paths problem on edge-colored graphs
A note on approximating the min–max vertex disjoint paths on directed acyclic graphs
Documents A note on approximating the min–max vertex disjoint paths on directed acyclic graphs
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
Documents A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem