Parameterized approximation algorithms for weighted vertex cover
From MaRDI portal
Publication:6547955
DOI10.1007/978-3-031-55601-2_12MaRDI QIDQ6547955
Saket Saurabh, Ashutosh Rai, Soumen Mandal, Pranabendu Misra
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- Improved upper bounds for vertex cover
- Improved algorithms for feedback vertex set problems
- Parameterized approximation via fidelity preserving transformations
- A multivariate framework for weighted FPT algorithms
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Vertex packings: Structural properties and algorithms
- On efficient fixed-parameter algorithms for weighted vertex cover
- Reducibility among Combinatorial Problems
- Towards a proof of the 2-to-1 games conjecture?
- Branching and Treewidth Based Exact Algorithms
- Parameterized complexity of weighted multicut in trees
- Directed flow-augmentation
This page was built for publication: Parameterized approximation algorithms for weighted vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547955)
