Pages that link to "Item:Q4420418"
From MaRDI portal
The following pages link to On efficient fixed-parameter algorithms for weighted vertex cover (Q4420418):
Displaying 31 items.
- Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover} (Q392028) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- Extended dynamic subgraph statistics using \(h\)-index parameterized data structures (Q443712) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Improved upper bounds for vertex cover (Q708228) (← links)
- Refined memorization for vertex cover (Q835007) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- Parameterized algorithms for \(d\)-hitting set: the weighted case (Q964386) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Counting the number of vertex covers in a trapezoid graph (Q990956) (← links)
- On two techniques of combining branching and treewidth (Q1022343) (← links)
- On parameterized exponential time complexity (Q1029333) (← links)
- Runtime analysis of RLS and \((1 + 1)\) EA for the dynamic weighted vertex cover problem (Q2182716) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- A note on the complexity of minimum dominating set (Q2458924) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- A refined search tree technique for dominating set on planar graphs (Q2575830) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- Parameterized Power Vertex Cover (Q3181050) (← links)
- Fixed-parameter tractability and data reduction for multicut in trees (Q3367053) (← links)
- A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)
- Parameterized approximation algorithms for weighted vertex cover (Q6547955) (← links)
- Parameterized approximation algorithms for weighted vertex cover (Q6639732) (← links)
