Approximation algorithms for the optimal p-source communication spanning tree

Authors:
Bang Ye Wu
Affiliations:
Department of Computer Science and Information Engineering, Shu-Te University, YanChau, Kaohsiung, Taiwan 824, ROC
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 9
Cited 4

Introduction to algorithms

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
A polynomial time approximation scheme for optimal product-requirement communication spanning trees

Journal of Algorithms
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
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees

Journal of Algorithms
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

An improved algorithm for the k-source maximum eccentricity spanning trees

Discrete Applied Mathematics
On the intercluster distance of a tree metric

Theoretical Computer Science
Tight bounds from a path based formulation for the tree of hub location problem

Computers and Operations Research
Approximation algorithms for 2-source minimum routing cost k-tree problems

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III

Quantified Score

Hi-index	0.05

Visualization

Abstract

The Pfaffian of an oriented graph is closely linked to perfect matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually exploited to give a fast algorithm ...