Reoptimization of parameterized problems
From MaRDI portal
Publication:2170282
DOI10.1007/S00236-022-00428-YOpenAlexW2893572497MaRDI QIDQ2170282FDOQ2170282
Elisabet Burjons, Peter Rossmanith, Hans-Joachim Böckenhauer, Martin Raszyk
Publication date: 30 August 2022
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.10578
Cites Work
- Title not available (Why is that?)
- Fundamentals of parameterized complexity
- Title not available (Why is that?)
- Finding odd cycle transversals.
- On problems without polynomial kernels
- Parametrized complexity theory.
- Parameterized Algorithms
- Vertex packings: Structural properties and algorithms
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Kernelization Lower Bounds Through Colors and IDs
- Spanning trees: A survey
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Kernel bounds for disjoint cycles and disjoint paths
- A Completeness Theory for Polynomial (Turing) Kernelization
- A linear vertex kernel for maximum internal spanning tree
- Kernel(s) for problems with no kernel
- On the Hardness of Reoptimization
- Crown structures for vertex cover kernelization
- Reoptimizing the traveling salesman problem
- Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
- Scheduling with forbidden sets
- On Finding Directed Trees with Many Leaves
- A Theory and Algorithms for Combinatorial Reoptimization
- Deterministic Parameterized Connected Vertex Cover
- A 2k-vertex Kernel for Maximum Internal Spanning Tree
- Dynamic parameterized problems
- On the parameterized complexity of dynamic problems
- A \(2k\)-kernelization algorithm for vertex cover based on crown decomposition
- Dynamic Parameterized Problems and Algorithms
Cited In (3)
This page was built for publication: Reoptimization of parameterized problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170282)
