On the crossing spanning tree problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3122, Issue , 2004, Pages 51-60

  Bilò, Vittorio ^a   Goyal, Vineet ^b   Ravi, R ^b   Singh, Mohit ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BIOINFORMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; TELECOMMUNICATION NETWORKS;

COMPUTATIONAL BIOLOGY; GREEDY ALGORITHMS; IP ROUTING; LP RELAXATION; NODE GRAPH; RANDOMIZED ALGORITHMS; SPANNING TREE; SPANNING TREE PROBLEMS;

TREES (MATHEMATICS);

EID: 33750230747     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27821-4_5     Document Type: Article

References (10)

1. K. Booth and G. Luker. 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.
2. th International Parallel and Distributed Processing Symposium(IPDPS), IEEE Press, 2004.
3. Michele Flammini, Giorgio Gambosi and Stefano Salomone. Interval Routing schemes. Algorithmica 16(6): 549-568, 1996.
4. Michele Flammini, Alberto Marchetti-Spaccamela and Jan van Leeuwen. The Complexity of Interval Routing on Random Graphs. The Computer Journal 41(1): 16-25, 1998.
5. Paul W. Goldberg, C. Golumbic, Martin, Haim Kaplan, and Ron Shamir. Four Strikes against Physical Mapping. Journal of Computational Biology, 2(1): 139-152, 1995.
6. David S. Greenberg and Sorin Istrail.Physical mapping by STS Hybridization: Algorithmic strategies and the challenges of software evaluation. Journal of Computational Biology, 2(2): 219-273, 1995.
7. Michael R. Garey and David S. Johnson Computers and Intractibility: A guide to the Theory of NP-completeness. W. H. Freeman and Company, New York, 1979.
8. M. Furer and B. Raghavachari. 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 '92), 317-324, 1992.
9. Philip N. Klein and R. Ravi. A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees. J. Algorithms 19(1): 104-115, 1995.
10. P. Raghavan and C. Thompson. Randomized Rounding. Combinatorica, Volume 7, 365-374, 1987.