Capitolo 6
Bibliografia
[1] N. Alon, R. Yuster, and U. Zwick, Color-coding, J. ACM 42 (1995), 844-856. [2] T.C. Bell, A. Moffat, and I.H. Witten, Managing Gigabytes, Morgan Kaufmann, 1999.
[3] P.Belotti, Multicommodity network design with survivability constraints: some models and algorithms, PhD thesis DEI-Politecnico di Milano (2003).
[4] P.M. Camerini, F. Maffioli, S. Martello, and P. Toth, Most and least uniform span- ning trees, Discrete Appl. Math. 15 (1986), 181-197.
[5] P. Cappanera and G.Gallo, A multi-commodity flow approach to the crew rostering problem, Oper. Res. 52 (2004), 583-596.
[6] P. Cappanera and M.G. Scutellà, Balanced paths in acyclic networks: tractable cases and related approaches, Networks 45 (2005), 104-111.
[7] P. Carraresi and G. Gallo, A multi-level bottleneck assignment approach to the bus drivers’ rostering problem, Eur. J. Oper. Res. 16 (1984), 163-173.
[8] T.H. Cormen, C.E. Leirson, and R.L. Rivest, Introduction to algoritms, The MIT press, 1990.
[9] M.R. Garey and D.S. Johnson, Computers and intractability: a guide to the theory of NP-Completeness, W.H. Freeman and Company, San Francisco, CA, 1979.
[10] F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1972.
[11] S.S. Lee and M. Gerla, Fault tollerance and load balancing in QoS provisioning with multilple MPLS paths, Lecture Notes in Computer Science LNCS 2092 (2001), 155-169.
[12] C-L. Li, S.T. McCormick, and D. Simchi-Levi, The complexity of finding two dis- joint paths with min-max objective function, Discrete Appl. Math. 26 (1990), 105-115. [13] S. Martello, W.R. Pulleyblank, P.Toth, and D. de Werra, Balanced optimization problems, Oper. Res. Lett. 5 (1984), 275-278.
[14] Y. Perl and Y. Shiloach, Finding two disjoint paths between two pairs of vertices in a graph, J. ACM 25 (1978), 1-9.
[15] B. Stroustrup, The C++ Programming Language, Third Edition. AT&T, 1999. [16] J. Walter, D. Kalev, M.J. Tabler, P.Snait, A. Kossoroukov, and S. Roberts, The Waite Group’s C++ How-To. SAMS, 2001.
