. Graphes-de-pires-cas, Lorsque celá etait possible, nous avons généré des instances quipì egent un algorithme en moyenne et en terme de rapportàrapportà l'erreur

D. Part, il est nécessaire de montrer que les différents algorithmes peuventêtrepeuventêtre mauvais en moyenne sur au moins une classe de graphes, et il est intéressant, d'autre part

Y. Bibliographie-[-aa92-]-noga-alon and . Azar, On-line steiner trees in the euclidean plane, SCG '92 : Proceedings of the eighth annual symposium on Computational geometry, pp.337-343, 1992.

B. Noga-alon, Y. Awerbuch, and . Azar, A general approach to online network optimization problems, ACM Transactions on Algorithms, vol.2, issue.4, pp.640-660, 2006.
DOI : 10.1145/1198513.1198522

[. Awerbuch, Y. Azar, and Y. Bartal, On-line generalized Steiner problem, SODA '96 : Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, pp.68-74, 1996.
DOI : 10.1016/j.tcs.2004.05.021

J. Alber, J. Gramm, and R. Niedermeier, Faster exact algorithms for hard problems: A parameterized point of view, Discrete Mathematics, vol.229, issue.1-3, pp.3-27, 2001.
DOI : 10.1016/S0012-365X(00)00199-0

D. Avis and T. Imamura, A list heuristic for vertex cover, Operations Research Letters, vol.35, issue.2, pp.201-204, 2007.
DOI : 10.1016/j.orl.2006.03.014

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.72.2433

[. Adelstein, G. G. Richard, I. , and L. Schwiebert, Distributed multicast tree generation with dynamic group membership, Computer Communications, vol.26, issue.10, pp.1105-1128, 2003.
DOI : 10.1016/S0140-3664(02)00239-6

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.4786

N. Faisal, R. L. Abu-khzam, M. R. Collins, M. A. Fellows, W. H. Langston et al., Kernelization algorithms for the vertex cover problem : Theory and experiments (extended abstract), Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), pp.62-69, 2004.

A. Angelopoulos, Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry, SODA '07 : Proceedings of the eighteenth annual ACM- SIAM symposium on Discrete algorithms, pp.248-257, 2007.

G. Ausiello, M. Protasi, A. Marchetti-spaccamela, G. Gambosi, P. Crescenzi et al., Complexity and Approximation : Combinatorial Optimization Problems and Their Approximability Properties, 1999.
DOI : 10.1007/978-3-642-58412-1

M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 1964.

[. Baille, L. Blin, and C. Laforest, Distributed approximation allocation ressources algorithm for connecting groups, Proceedings of the European Conference on Parallel Computing, pp.519-529, 2006.
DOI : 10.1007/11823285_54

E. Birmelé, F. Delbot, and C. Laforest, Mean analysis of an online algorithm for the vertex cover problem, Information Processing Letters, vol.109, issue.9, pp.436-439, 2009.
DOI : 10.1016/j.ipl.2008.12.021

A. Borodin and R. El-yaniv, Online computation and competitive analysis, 1998.

M. [. Balasubramanian, V. Fellows, and . Raman, An improved fixed-parameter algorithm for vertex cover, Information Processing Letters, vol.65, issue.3, pp.163-168, 1998.
DOI : 10.1016/S0020-0190(97)00213-5

]. B. Bol01 and . Bollobas, Random Graphs, 2001.

P. Bremaud, Introduction aux probabilités, 1997.

S. [. Bar-yehuda and . Even, A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem, Annals of Discrete Mathematics, vol.25, 1985.
DOI : 10.1016/S0304-0208(08)73101-3

J. Cheetham, F. Dehne, A. Rau-chaplin, U. Stege, and P. J. Taillon, Solving large FPT problems on coarse-grained parallel machines, Journal of Computer and System Sciences, vol.67, issue.4, pp.691-706, 2003.
DOI : 10.1016/S0022-0000(03)00075-8

J. Chen, I. A. Kanj, and W. Jia, Vertex Cover: Further Observations and Further Improvements, Journal of Algorithms, vol.41, issue.2, pp.280-301, 2001.
DOI : 10.1006/jagm.2001.1186

M. J. Cardinal, S. Labbé, E. Langerman, H. Levy, and . Mélot, A Tight Analysis of the Maximal Matching Heuristic, Computing and Combinatorics : 11th Annual International Conference, pp.701-709, 2005.
DOI : 10.1007/11533719_71

URL : https://hal.archives-ouvertes.fr/hal-01255575

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introductionàtroduction`troductionà l'algorithmique. Dunod, 1990.

A. Stephen and . Cook, The complexity of theorem-proving procedures, STOC '71 : Proceedings of the third annual ACM symposium on Theory of computing, pp.151-158, 1971.

[. Delbot, Rapport de stage de M2 recherche Comparaison de deux algorithmes d'approximation pour leprobì eme de la couverture d'arêtes par des sommets. Master's thesis, Laboratoire IBISC, 2006.

G. Rod, M. R. Downey, and . Fellows, Fixed-parameter tractability and completeness II : On completeness for W [1], Theoretical Computer Science, vol.141, issue.12, pp.109-131, 1995.

M. [. Downey and . Fellows, Parameterized complexity, 1998.
DOI : 10.1007/978-1-4612-0515-9

M. Dyer, A. Frieze, and B. Pittel, The Average Performance of the Greedy Matching Algorithm, The Annals of Applied Probability, vol.3, issue.2, 1993.
DOI : 10.1214/aoap/1177005436

R. G. Downey, M. R. Fellows, and U. Stege, Parameterized complexity : A framework for systematically confronting computational intractability, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.49-99, 1997.
DOI : 10.1007/978-1-4612-0515-9

[. Delbot, C. Delbot, C. Laforest, and N. Thibault, A better list heuristic for vertex cover Evaluation en moyenne d'un algorithme pour la misè a jour d'arbre de connexion, AlgoTel 2007, 9` eme rencontres francophones sur les aspects algorithmiques de télécommunications, pp.3-4125, 2007.

M. Demange, V. Th, and . Paschos, On-line vertex-covering, Theoretical Computer Science, vol.332, issue.1-3, pp.83-108, 2005.
DOI : 10.1016/j.tcs.2004.08.015

W. Feller, An Introduction to Probability Theory and Its Applications, 1971.

R. Michael and . Fellows, Parameterized complexity : The main ideas and some research frontiers, ISAAC '01 : Proceedings of the 12th International Symposium on Algorithms and Computation, pp.291-307, 2001.

A. Fiat and G. J. Woeginger, The State of the Art (the book grow out of a Dagstuhl Seminar, Online Algorithms, 1996.

B. Gauthier, M. Garey, D. Johnson, M. R. Garey, D. S. Johnson et al., Computers and Intractability Some simplified np-complete problems, Calcul symbolique sur les séries hypergéométriques STOC '74 : Proceedings of the sixth annual ACM symposium on Theory of computing Munagala. Extending greedy multicast routing to delay sensitive applications. Algorithmica, pp.47-63, 1974.

M. L. Micha-l-ha´n´ckowiakha´n´ha´n´ckowiak, A. Karo´nskikaro´nski, and . Panconesi, On the distributed complexity of computing maximal matchings, SODA '98 : Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pp.219-225, 1998.

D. S. Hochbaum, Approximation algorithms for NP-hard problems, 1997.

A. Israel and A. Itai, A fast and simple randomized parallel algorithm for maximal matching, Information Processing Letters, vol.22, issue.2, pp.77-80, 1986.
DOI : 10.1016/0020-0190(86)90144-4

M. Imase, B. Waxmankar72, and ]. R. Karp, Dynamic steiner tree problem Reducibility among combinatorial problems, SIAM Journal of Discrete Mathematics Complexity of Computer Computations, vol.4, issue.3, pp.369-384, 1972.

G. Karakostas, A better approximation ratio for the vertex cover problem, International Colloquium on Automata, Languages and Programming, pp.1043-1050, 2005.

S. Khuri and T. Bäck, An evolutionary heuristic for the minimum vertex cover problem, Genetic Algorithms within the Framework of Evolutionary Computation ? Proc. of the KI-94 Workshop, pp.86-90, 1994.

[. Kotecha and N. Gambhava, A hybrid genetic algorithm for minimum vertex cover problem, 1st Indian International Conference on Artificial Intelligence, pp.904-913, 2003.

F. Kuhn, T. Moscibroda, and R. Wattenhofer, What cannot be computed locally ! In PODC, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp.300-309, 2004.

F. Kuhn, T. Moscibroda, and R. Wattenhofer, The price of being nearsighted, SODA '06 : Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm ACM. [KR08] Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2 ? ?, pp.980-989, 2006.

L. Layuan and L. Chunlin, A QoS multicast routing protocol for dynamic group topology, Probabilistic Methods for Algorithmic Discrete Mathematics, pp.113-130, 1998.
DOI : 10.1016/j.ins.2004.02.008

J. Monnot, T. Vangelis, S. Paschos, and . Toulouse, Polynomial approximation of hard NP-problems : local extremals and differential relation. (Approximation polynomiale desprobì emes NP-difficiles : optima locaux et rapport différentiel [MS85] Burkhard Monien and Ewald Speckenmeyer. Ramsey numbers and an approximation algorithm for the vertex cover problem On efficient fixed parameter algorithms for weighted vertex cover Paschos. A survey of approximately optimal solutions to some covering and packing problems, NR00] Rolf Niedermeier and Peter Rossmanith International Symposium on Algorithms and Computation, pp.115-123, 1985.

A. Panconesi, R. R. , V. Polishchuk, and J. , A simple local 3-approximation algorithm for vertex cover [PY88] Christos Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes Algorithms for building multiple sequence alignments and evolutionary trees [Sav82] Carla Savage. Depth-first search and the vertex cover problem An ant colony optimization algorithm for the minimum weight vertex cover problem, Some simple distributed algorithms for sparse networks. Distributed Computing STOC '88 : Proceedings of the twentieth annual ACM symposium on Theory of computing, pp.97-100642, 1982.

G. [. Sriram, C. Manimaran, and . Murthy, A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), pp.514-529, 1999.
DOI : 10.1109/INFCOM.1999.751662

U. Stege, Resolving conflicts from problems in computational biology, 2000.

[. Thibault, Algorithmes d'approximation pour l'optimisation en ligne d'ordonnancements et de structures de communications, 2006.
URL : https://hal.archives-ouvertes.fr/tel-00422420

N. Thibault and C. Laforest, An optimal online strategy to increment connection trees, Workshop Adaptive Wireless Networks of Globecom, 2004.

N. Thibault and C. Laforest, Ajouts et retraits dans un arbre de connexion, AlgoTel, pp.33-36, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00341381

N. Thibault and C. Laforest, An Optimal Rebuilding Strategy for a Decremental Tree Problem, International colloquium on structural information and communication complexity (SIROCCO), volume LNCS 4056, pp.157-170, 2006.
DOI : 10.1007/11780823_13

URL : https://hal.archives-ouvertes.fr/hal-00341384

N. Thibault and C. Laforest, Minimizing the number of critical stages for the on-line steiner tree problem, International Network Optimization Conference, 2007.

N. Thibault and C. Laforest, AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM, Journal of Interconnection Networks, vol.08, issue.01, pp.75-99, 2007.
DOI : 10.1142/S0219265907001916

URL : https://hal.archives-ouvertes.fr/hal-00341382

B. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, vol.6, issue.9, pp.1617-1622, 1988.
DOI : 10.1109/49.12889

K. Xu, F. Boussemart, F. Hemery, and C. Lecoutre, Random constraint satisfaction: Easy generation of hard (satisfiable) instances, Artificial Intelligence, vol.171, issue.8-9, pp.8-9514, 2007.
DOI : 10.1016/j.artint.2007.04.001

URL : https://hal.archives-ouvertes.fr/hal-00191088

K. Xu and W. Li, Many hard examples in exact phase transitions, Theoretical Computer Science, vol.355, issue.3, pp.291-302, 2006.
DOI : 10.1016/j.tcs.2006.01.001

X. Xu and J. Ma, An efficient simulated annealing algorithm for the minimum vertex cover problem, Neurocomputing, vol.69, issue.7-9, pp.913-916, 2006.
DOI : 10.1016/j.neucom.2005.12.016

[. Yuan and S. Kuo, A new technique for optimization problems in graph theory, IEEE Transactions on Computers, vol.47, issue.2, pp.190-196, 1998.
DOI : 10.1109/12.663765

Q. Zhang, R. Ge, T. Fleischer, H. Jiang, and . Zhu, Approximating the minimum weight weak vertex cover, Theoretical Computer Science, vol.363, issue.1, pp.99-105, 2006.
DOI : 10.1016/j.tcs.2006.06.009

[. Zhao and M. Médard, Online Network Coding for the Dynamic Multicast Problem, 2006 IEEE International Symposium on Information Theory, pp.1753-1757, 2006.
DOI : 10.1109/ISIT.2006.261655