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 ,
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 ,
On-line steiner trees in the euclidean plane, SCG '92 : Proceedings of the eighth annual symposium on Computational geometry, pp.337-343, 1992. ,
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
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
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
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
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
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. ,
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. ,
Complexity and Approximation : Combinatorial Optimization Problems and Their Approximability Properties, 1999. ,
DOI : 10.1007/978-3-642-58412-1
Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 1964. ,
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
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
Online computation and competitive analysis, 1998. ,
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
Random Graphs, 2001. ,
Introduction aux probabilités, 1997. ,
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
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
Vertex Cover: Further Observations and Further Improvements, Journal of Algorithms, vol.41, issue.2, pp.280-301, 2001. ,
DOI : 10.1006/jagm.2001.1186
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
Introductionàtroduction`troductionà l'algorithmique. Dunod, 1990. ,
The complexity of theorem-proving procedures, STOC '71 : Proceedings of the third annual ACM symposium on Theory of computing, pp.151-158, 1971. ,
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. ,
Fixed-parameter tractability and completeness II : On completeness for W [1], Theoretical Computer Science, vol.141, issue.12, pp.109-131, 1995. ,
Parameterized complexity, 1998. ,
DOI : 10.1007/978-1-4612-0515-9
The Average Performance of the Greedy Matching Algorithm, The Annals of Applied Probability, vol.3, issue.2, 1993. ,
DOI : 10.1214/aoap/1177005436
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
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. ,
On-line vertex-covering, Theoretical Computer Science, vol.332, issue.1-3, pp.83-108, 2005. ,
DOI : 10.1016/j.tcs.2004.08.015
An Introduction to Probability Theory and Its Applications, 1971. ,
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. ,
The State of the Art (the book grow out of a Dagstuhl Seminar, Online Algorithms, 1996. ,
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. ,
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. ,
Approximation algorithms for NP-hard problems, 1997. ,
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
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. ,
A better approximation ratio for the vertex cover problem, International Colloquium on Automata, Languages and Programming, pp.1043-1050, 2005. ,
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. ,
A hybrid genetic algorithm for minimum vertex cover problem, 1st Indian International Conference on Artificial Intelligence, pp.904-913, 2003. ,
What cannot be computed locally ! In PODC, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp.300-309, 2004. ,
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. ,
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
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 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. ,
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
Resolving conflicts from problems in computational biology, 2000. ,
Algorithmes d'approximation pour l'optimisation en ligne d'ordonnancements et de structures de communications, 2006. ,
URL : https://hal.archives-ouvertes.fr/tel-00422420
An optimal online strategy to increment connection trees, Workshop Adaptive Wireless Networks of Globecom, 2004. ,
Ajouts et retraits dans un arbre de connexion, AlgoTel, pp.33-36, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00341381
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
Minimizing the number of critical stages for the on-line steiner tree problem, International Network Optimization Conference, 2007. ,
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
Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, vol.6, issue.9, pp.1617-1622, 1988. ,
DOI : 10.1109/49.12889
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
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
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
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
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
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