Ramsey numbers and an approximation algorithm for the vertex cover problem-Reference-Cited by-同舟云学术

Ramsey numbers and an approximation algorithm for the vertex cover problem

Published:1985-04 Issue:1 Volume:22 Page:115-123
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Monien Burkhard,Speckenmeyer Ewald

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00290149.pdf

Reference15 articles.

1. Ajtai, M., Komlós, J., Szemeredi, E.: A note on Ramsey numbers. J. Comb. Theory, Ser. A 29, 354?360 (1980)

2. Bar-Yehuda, R., Even, S.: On approximating a vertex cover for planar graphs. Proc. 14th Ann. ACM Symp. Th. Computing, pp. 303?309. San Francisco 1982

3. Bar-Yehuda, R, Even, S.: A 2?log logn/2logn performance ratio for the weighted vertex cover problem. Technion Haifa, Technical Report #260, January 1983

4. Erdös, P.: Graph theory and probability, Can. J. Math. 11, 34?38 (1959)

5. Erdös, P., Gallai, T.: On the minimal number of vertices representing the edges of a graph, pp. 181?203. Magyar Tudományos Akadémia Matematikai Kutato Intézetének Közleményei VI. Evfolyam 1961

Cited by 113 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Disjointness graphs of short polygonal chains;Journal of Combinatorial Theory, Series B;2024-01

2. Graph Covering Using Bounded Size Subgraphs;Algorithms and Discrete Applied Mathematics;2023

3. A Random Memory Length Adaptive Algorithm for Vertex Cover Problem;IFAC-PapersOnLine;2023

4. The Power of Amortized Recourse for Online Graph Problems;Approximation and Online Algorithms;2022

5. A Probabilistic Algorithm for Vertex Cover;SSRN Electronic Journal;2022