Exact Algorithms for Minimum Routing Cost Trees

Networks

Volumn 39, Issue 3, 2002, Pages 161-173

  Fischetti, Matteo ^a   Lancia, Giuseppe ^a   Serafini, Paolo ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b UNIVERSITY OF UDINE   (Italy)

Author keywords

Branch and price; Computational biology; Network design

Indexed keywords

ALGORITHMS; GENES; HEURISTIC METHODS; TREES (MATHEMATICS);

COMPUTATIONAL BIOLOGY;

TELECOMMUNICATION NETWORKS;

EID: 0141429060     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10022     Document Type: Article

References (18)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows: Theory, algorithms and applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. R. Dionne and M. Florian, Exact and approximate algorithms for optimal network design, Networks 9 (1979), 37-60.
3. D. Feng and R. Doolittle, Progressive sequence alignment as a prerequisite to correct phylogenetic trees, J Mol Evol 25 (1987), 351-360.
4. M. Fischetti, G. Lancia, and P. Serafmi, A computational analysis of exact algorithms for the minimum routing cost tree problem, Technical report, Dept. of Electronics and Informatics, University of Padova, 2001. Available at http://www.dei.unipd.it/̃lancia/TR-MRC.ps.
5. D. Gusfield, Efficient methods for multiple sequence alignment with guaranteed error bounds, Bull Math Biol 55 (1993), 141-154.
6. T.C. Hu, Optimum communication spanning trees, SIAM J Comp 3 (1974), 188-195.
7. D.S. Johnson, J.K. Lenstra, and A.H.G. Rinnooy Kan, The complexity of the network design problem, Networks 8 (1978), 279-285.
8. J. Linderoth and M.W.P. Savelsbergh, A computational study of search strategies for mixed integer programming, Report LEC-97-12, Georgia Institute of Technology, 1997.
9. G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988.
10. PORTA, a POlyhedron Representation Transformation Algorithm. Available at http://www.iwr.uniheidelberg.de/iwr/comopt/software/PORTA.
11. PRINTS, http://bmbsgi11.leeds.ac.uk/cgibin/prints.sh.
12. D. Sankoff and J.B. Kruskal (Editors), Time warps, string edits and macromolecules: The theory and practice of sequence comparison, Addison-Wesley, Reading, MA, 1983.
13. D. Sankoff, C. Morel, and R.J. Cedergren, Evolution of the 5S ribosomal RNA, Nature New Biol 245 (1973), 232-234.
14. A.J. Scott, The optimal network problem: Some computational procedures, Trans Res 3 (1969), 201-210.
15. W.R. Taylor and D.T. Jones, Deriving an amino acid distance matrix, J Theor Biol 164 (1993), 65-83.
16. L. Wang and T. Jiang, On the complexity of multiple sequence alignment, J Comp Biol 1 (1994), 337-348.
17. R. Wong, Worst-case analysis of network design problem heuristics, SIAM J Alg Discr Methods 1 (1980), 51-63.
18. B.Y. Wu, G. Lancia, V. Bafna, K.M. Chao, R. Ravi, and C.Y. Tang, A polynomial-time approximation scheme for minimum routing cost spanning trees, SIAM J Comp 29 (1999), 761-778.