Vertex Cover Approximation

Vertex Cover Approximation is a greedy algorithm that belongs to the class of approximation algorithms, specifically designed to efficiently compute a near-optimal solution to the vertex cover problem by iteratively selecting endpoints of uncovered edges until all edges are incident to at least one selected vertex.

300

Publications

18.7K

Citations

547

Authors

273

Institutions

Publications per year

2017–2026

53

Authors

547

  1. SK
    Subhash Khot

    Georgia Institute of Technology, United States

    8 publications · 1.2K citations

    8

    h-index

  2. ID
    Irit Dinur

    Weizmann Institute of Science, Israel

    7 publications · 1.1K citations

    7

    h-index

  3. VG
    Venkatesan Guruswami

    Carnegie Mellon University, United States

    7 publications · 265 citations

    7

    h-index

  4. JC
    Jianer Chen

    Texas A&M University, United States

    6 publications · 941 citations

    6

    h-index

  5. ZZ
    Zhao Zhang

    Zhejiang Normal University, China

    6 publications · 94 citations

    6

    h-index

1–5 of 547

Venues

  1. Theoretical Computer Science

    17 publications · 959 citations

    14

    h-index

  2. Information Processing Letters

    19 publications · 842 citations

    14

    h-index

  3. Discrete Applied Mathematics

    15 publications · 862 citations

    13

    h-index

  4. SIAM Journal on Discrete Mathematics

    10 publications · 536 citations

    10

    h-index

  5. SIAM Journal on Computing

    9 publications · 1.4K citations

    9

    h-index

1–5