Pages that link to "Item:Q818673"
From MaRDI portal
The following pages link to Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems (Q818673):
Displayed 13 items.
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3 (Q1026228) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- Improved algorithms for the general exact satisfiability problem (Q2232607) (← links)
- Fixed-parameter approximation: conceptual framework and approximability results (Q2379929) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)