Kernels for the vertex cover problem on the preferred attachment model

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

Volumn 4007 LNCS, Issue , 2006, Pages 231-240

  Díaz, Josep ^a   Petit, Jordi ^a   Thilikos, Dimitrios M ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; WORLD WIDE WEB;

KERNELS; PREPROCESSING ALGORITHMS; VERTEX COVER PROBLEM;

PROBLEM SOLVING;

EID: 33746069007     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11764298_21     Document Type: Conference Paper

References (18)

1. Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langsten, W. Henry Suters, and Christof T. Symons. Kernelization algorithms for the vertex cover problem: Theory and experiments. In Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, New Orleans, LA, USA, pages 62-69. SIAM, 2004.
2. Albert-László Barabási. Emergence of scaling in complex networks. In Handbook of graphs and networks, pages 69-84. Wiley-VCH, Weinheim, 2003.
3. Albert-Lászĺ Barabási and Réka Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
4. Béla Bollobás, Oliver Riordan, Joel Spencer, and Gábor Tusnády. The degree sequence of a scale-free random graph process. Random Structures Algorithms, 18(3):279-290, 2001.
5. J.F. Buss and J. Goldsmith. Nondeterminism within p. SIAM J. Computing, 22:560-572, 1993.
6. Jianer Chen, Iyad A. Kanj, and Ge Xia. Simplicity is beauty: Improved upper bounds for vertex cover. Technical Report 05-008, Texas A&M University, Utrecht, the Netherlands, April 2005.
7. Aaron Clauset and Cristopher Moore. Accuracy and scaling phenomena in internet mapping. Phys. Rev. Lett., 94, 2005.
8. R. G. Downey and M. R. Fellows. Parameterized complexity. Monographs in Computer Science. Springer-Verlag, New York, 1999.
9. Michael R. Fellows. Parameterized complexity: the main ideas and some research frontiers. In Algorithms and computation (Christchurch, 2001), volume 2223 of Lecture Notes in Comput. Sci., pages 291-307. Springer, Berlin, 2001.
10. Michael R. Fellows. Blow-ups, win/win's, and crown rules: Some new directions in fpt. In Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, Lecture Notes in Computer Science, pages 1-12. Springer, 2003.
11. 0.288n) independent set algorithm. In 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), page to appear. ACM and SIAM, New York, 2006.
12. Johan Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859 (electronic), 2001.
13. George Karakostas. A better approximation ratio for the vertex cover problem. In Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, (ICALP), Lecture Notes in Computer Science, pages 1043-1050. Springer, 2005.
14. Richard M. Karp. Reducibility among combinatorial problems. In Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), pages 85-103. Plenum, New York, 1972.
15. Burkhard Monien and Ewald Speckenmeyer. Ramsey numbers and an approximation algorithm for the vertex cover problem. Acta Inform., 22(1):115-123, 1985.
16. G. L. Nemhauser and L. E. Trotter, Jr. Vertex packings: structural properties and algorithms. Math. Programming, 8:232-248, 1975.
17. Mark E. J. Newman. Random graphs as models of networks. In Handbook of graphs and networks, pages 35-68. Wiley-VCH, Weinheim, 2003.
18. n/4). manuscript, http://dept-info.labri.fr/robson/mis/techrep.html, 2001.