Reoptimization of parameterized problems
From MaRDI portal
Publication:2170282
DOI10.1007/S00236-022-00428-YOpenAlexW2893572497MaRDI QIDQ2170282FDOQ2170282
Authors: Hans-Joachim Böckenhauer, Elisabet Burjons, Martin Raszyk, Peter Rossmanith 
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
Recommendations
- On the parameterized complexity of reconfiguration problems
- On the parameterized complexity of reconfiguration problems
- On the parameterized complexity of dynamic problems
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
- Reoptimization of Weighted Graph and Covering Problems
Cites Work
- Introduction to algorithms.
- 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)
