A Multivariate Approach for Weighted FPT Algorithms
From MaRDI portal
Publication:3452855
DOI10.1007/978-3-662-48350-3_80zbMath1466.68047OpenAlexW2401114553MaRDI QIDQ3452855
Publication date: 19 November 2015
Published in: Algorithms - ESA 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48350-3_80
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
Uses Software
Cites Work
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Fundamentals of parameterized complexity
- Parameterized edge dominating set in graphs with degree bounded by 3
- New parameterized algorithms for the edge dominating set problem
- Improved upper bounds for vertex cover
- Improved algorithms for feedback vertex set problems
- Algorithm engineering for color-coding with applications to signaling pathway detection
- Parameterized algorithms for \(d\)-hitting set: the weighted case
- On two techniques of combining branching and treewidth
- Approximating the maximum internal spanning tree problem
- A multivariate framework for weighted FPT algorithms
- Crown reductions for the minimum weighted vertex cover problem
- Vertex Cover: Further Observations and Further Improvements
- Algorithms for k-Internal Out-Branching
- Deterministic Parameterized Connected Vertex Cover
- Representative Families: A Unified Tradeoff-Based Approach
- Enumerate and Measure: Improving Parameter Budget Management
- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem
- Mixing Color Coding-Related Techniques
- Color-coding
- On efficient fixed-parameter algorithms for weighted vertex cover
- Minimum bisection is fixed parameter tractable
- Branching and Treewidth Based Exact Algorithms
This page was built for publication: A Multivariate Approach for Weighted FPT Algorithms
