Refined memorization for vertex cover
From MaRDI portal
Publication:835007
DOI10.1016/j.ipl.2004.10.003zbMath1173.68529OpenAlexW1976697697MaRDI QIDQ835007
Fabrizio Grandoni, L. Sunil Chandran
Publication date: 27 August 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2004.10.003
Related Items (15)
Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets ⋮ Exact algorithms and applications for tree-like Weighted Set Cover ⋮ A multivariate framework for weighted FPT algorithms ⋮ Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ A novel parameterised approximation algorithm for \textsc{minimum vertex cover} ⋮ Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} ⋮ Minimum Leaf Out-Branching Problems ⋮ An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} ⋮ Enumerate and expand: Improved algorithms for connected vertex cover and tree cover ⋮ Improved upper bounds for vertex cover ⋮ A bounded search tree algorithm for parameterized face cover ⋮ On two techniques of combining branching and treewidth ⋮ On parameterized exponential time complexity ⋮ Rank Vertex Cover as a Natural Problem for Algebraic Compression
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved fixed-parameter algorithm for vertex cover
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- A general method to speed up fixed-parameter-tractable algorithms
- Vertex Cover: Further Observations and Further Improvements
- Algorithms for maximum independent sets
- Nondeterminism within $P^ * $
- On efficient fixed-parameter algorithms for weighted vertex cover
This page was built for publication: Refined memorization for vertex cover
