Pages that link to "Item:Q835007"

The following pages link to Refined memorization for vertex cover (Q835007):

Displaying 15 items.

• A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
• Improved upper bounds for vertex cover (Q708228) (← links)
• Exact algorithms and applications for tree-like Weighted Set Cover (Q866547) (← links)
• Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
• A bounded search tree algorithm for parameterized face cover (Q1002098) (← links)
• On two techniques of combining branching and treewidth (Q1022343) (← links)
• On parameterized exponential time complexity (Q1029333) (← links)
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
• Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets (Q3195130) (← links)
• Minimum Leaf Out-Branching Problems (Q3511432) (← links)
• Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
• Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)