Concept

Edge cover

OpenAlex ID: C17762858

Paths, Trees, and Flowers

1965 · Jack Edmonds · Canadian Journal of Mathematics · 2,569

PDF

Approximation Algorithms for the Set Covering and Vertex Cover Problems

1982 · Dorit S. Hochbaum · SIAM Journal on Computing · 518

Node-and edge-deletion NP-complete problems

1978 · Mihalis Yannakakis · ACM Symposium on Theory of Computing (STOC) · 473

PDF

Vertex Cover: Further Observations and Further Improvements

2001 · Jianer Chen, Iyad A. Kanj, et al. · Journal of Algorithms · 445

A linear-time approximation algorithm for the weighted vertex cover problem

1981 · R Bar-Yehuda, S Even · Journal of Algorithms · 433

A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

1999 · Vineet Bafna, Piotr Berman, et al. · SIAM Journal on Discrete Mathematics · 351

Learning a SAT Solver from Single-Bit Supervision

2018 · Selsam, Daniel, Lamm, Matthew, et al. · arXiv (Cornell University) · 345

PDF

Efficient bounds for the stable set, vertex cover and set packing problems

1983 · Dorit S. Hochbaum · Discrete Applied Mathematics · 274

Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs

1999 · Robert Preis · Lecture notes in computer science · 246

Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems

1996 · Dorit S. Hochbaum · PWS Publishing Co. eBooks · 224

Approximation algorithms for partial covering problems

2004 · Rajiv Gandhi, Samir Khuller, et al. · Journal of Algorithms · 208

An improved fixed-parameter algorithm for vertex cover

1998 · R. Balasubramanian, Michael R. Fellows, et al. · Information Processing Letters · 200

Algorithmic Aspects of the Core of Combinatorial Optimization Games

1999 · Xiaotie Deng, Toshihide Ibaraki, et al. · Mathematics of Operations Research · 184

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

2001 · Jochen Alber, Henning Fernau, et al. · Lecture notes in computer science · 179

Balanced graph edge partition

2014 · Florian Bourse, Marc Lelarge, et al. · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · 168

Approximating Min Sum Set Cover

2004 · Uriel Feige, László Lovász, et al. · Algorithmica · 168

Graph Layout Problems Parameterized by Vertex Cover

2008 · Michael R. Fellows, Daniel Lokshtanov, et al. · Lecture notes in computer science · 154

On efficient fixed-parameter algorithms for weighted vertex cover

2003 · Rolf Niedermeier, Peter Rossmanith · Journal of Algorithms · 153

Bidimensionality: new connections between FPT algorithms and PTASs

2005 · Erik D. Demaine, MohammadTaghi Hajiaghayi · 145

Data reduction and exact algorithms for clique cover

2008 · Jens Gramm, Jiong Guo, et al. · ACM Journal of Experimental Algorithmics · 138

Crown Structures for Vertex Cover Kernelization

2007 · Faisal N. Abu-Khzam, Michael R. Fellows, et al. · Theory of Computing Systems · 136

Parameterized Complexity of Vertex Cover Variants

2007 · Jiong Guo, Rolf Niedermeier, et al. · Theory of Computing Systems · 135

Algorithms for Graphs Embeddable with Few Crossings per Edge

2007 · Alexander Grigoriev, Hans L. Bodlaender · Algorithmica · 134

Depth-first search and the vertex cover problem

1982 · Carla Savage · Information Processing Letters · 134

Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

2018 · Mohsen Ghaffari, Themis Gouleakis, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 128

PDF

Works count: 1,712

Citation count: 24,050