Abstract
Given an undirected n-node graph and a set \({\cal C}\) of m cuts, the minimum crossing spanning tree is a spanning tree which minimizes the maximum crossing of any cut in \({\cal C}\), where the crossing of a cut is the number of edges in the intersection of this cut and the tree. This problem finds applications in fields as diverse as Computational Biology and IP Routing Table Minimization.
We show that a greedy algorithm gives an O(rlog n) approximation for the problem where any edge occurs in at most r cuts. We then demonstrate that the problem remains NP-hard even when G is complete. For the latter case, we design a randomized algorithm that gives a tree T with crossing O((log m+log n) ·( OPT+ log n)) w.h.p., where OPT is the minimum crossing of any tree.
Our greedy analysis extends the traditional one used for set cover. The randomized algorithm rounds a LP relaxation of a corresponding subproblem in stages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Booth, K., Luker, G.: Testing for the consecutive ones property, interval graphs and graph planarity using pq-tree algorithms. Journal of Computer and System Sciences 13, 335–379 (1976)
Bilo, V., Flammini, M.: On the IP routing tables minimization with addresses reassignments. In: Proc. of the 18th International Parallel and Distributed Processing Symposium (IPDPS), IEEE Press, Los Alamitos (2004)
Flammini, M., Gambosi, G., Salomone, S.: Interval Routing schemes. Algorithmica 16(6), 549–568 (1996)
Flammini, M., Marchetti-Spaccamela, A., van Leeuwen, J.: The Complexity of Interval Routing on Random Graphs. The Computer Journal 41(1), 16–25 (1998)
Goldberg, P.W., Golumbic, C., Martin, Kaplan, H., Shamir, R.: Four Strikes against Physical Mapping. Journal of Computational Biology 2(1), 139–152 (1995)
Greenberg, D.S., Istrail, S.: Physical mapping by STS Hybridization: Algorithmic strategies and the challenges of software evaluation. Journal of Computational Biology 2(2), 219–273 (1995)
Garey, M.R., Johnson, D.S.: Computers and Intractibility: A guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)
Furer, M., Raghavachari, B.: Approximating the minimum degree spanning tree to within one from the optimal degree. In: Proceedings of the Third Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 1992), pp. 317–324 (1992)
Klein, P.N., Ravi, R.: A Nearly Best-Possible Approximation Algorithm for Node- Weighted Steiner. Trees. J. Algorithms 19(1), 104–115 (1995)
Raghavan, P., Thompson, C.: Randomized Rounding. Combinatorica 7, 365–374 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bilò, V., Goyal, V., Ravi, R., Singh, M. (2004). On the Crossing Spanning Tree Problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2004 2004. Lecture Notes in Computer Science, vol 3122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27821-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-27821-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22894-3
Online ISBN: 978-3-540-27821-4
eBook Packages: Springer Book Archive