A survey of graph layout problems
ACM Computing Surveys (CSUR)
Non-approximability of Weighted Multiple Sequence Alignment
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Non-approximability of weighted multiple sequence alignment
Theoretical Computer Science - Computing and combinatorics
MAD Trees and distance-hereditary graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
A linear-time algorithm to compute a MAD tree of an interval graph
Information Processing Letters
Integer programming models for computational biology problems
Journal of Computer Science and Technology - Special issue on bioinformatics
Approximation algorithms for the optimal p-source communication spanning tree
Discrete Applied Mathematics
An improved algorithm for the k-source maximum eccentricity spanning trees
Discrete Applied Mathematics
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Non-approximability of weighted multiple sequence alignment for arbitrary metrics
Information Processing Letters
Information Processing Letters
On the intercluster distance of a tree metric
Theoretical Computer Science
On the uniform edge-partition of a tree
Discrete Applied Mathematics
Multiple Sequence Alignment as a Facility-Location Problem
INFORMS Journal on Computing
The zoo of tree spanner problems
Discrete Applied Mathematics
MAD trees and distance-hereditary graphs
Discrete Applied Mathematics
Non-approximability of weighted multiple sequence alignment for arbitrary metrics
Information Processing Letters
Efficient routing from multiple sources to multiple sinks in wireless sensor networks
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Approximating border length for DNA microarray synthesis
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
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
Finding best swap edges minimizing the routing cost of a spanning tree
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the approximability of the minimum strictly fundamental cycle basis problem
Discrete Applied Mathematics
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Efficient cycle search for the minimum routing cost spanning tree problem
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Compact vs. exponential-size LP relaxations
Operations Research Letters
Parallel approximation algorithms for minimum routing cost spanning tree
International Journal of Computational Science and Engineering
Hi-index | 0.01 |
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between the pair in the tree. Finding a spanning tree of minimum routing cost is NP-hard, even when the costs obey the triangle inequality. We show that the general case is in fact reducible to the metric case and present a polynomial-time approximation scheme valid for both versions of the problem. In particular, we show how to build a spanning tree of an n-vertex weighted graph with routing cost at most $(1+\epsilon)$ of the minimum in time $O(n^{O({\frac{1}{\epsilon}}% )})$. Besides the obvious connection to network design, trees with small routing cost also find application in the construction of good multiple sequence alignments in computational biology. The communication cost spanning tree problem is a generalization of the minimum routing cost tree problem where the routing costs of different pairs are weighted by different requirement amounts. We observe that a randomized O(log n log log n)-approximation for this problem follows directly from a recent result of Bartal, where n is the number of nodes in a metric graph. This also yields the same approximation for the generalized sum-of-pairs alignment problem in computational biology.