A probabilistic algorithm for vertex cover
From MaRDI portal
Publication:6144024
DOI10.1016/j.tcs.2023.114306OpenAlexW4388767573MaRDI QIDQ6144024
Publication date: 5 January 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114306
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Efficient bounds for the stable set, vertex cover and set packing problems
- On approximation properties of the independent set problem for low degree graphs
- Solving vertex cover in polynomial time on hyperbolic random graphs
- A Remark on Stirling's Formula
- Paths in graphs
This page was built for publication: A probabilistic algorithm for vertex cover