Multistage Vertex Cover
From MaRDI portal
Publication:5875546
DOI10.4230/LIPIcs.IPEC.2019.14OpenAlexW2996918322MaRDI QIDQ5875546
Till Fluschnik, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche
Publication date: 3 February 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11475/pdf/LIPIcs-IPEC-2019-14.pdf/
NP-hardnessfixed-parameter tractabilitykernelizationtemporal graphsdynamic graph problemstime-evolving networksw[1-hardness]
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (10)
Multistage knapsack ⋮ Multistage graph problems on a global budget ⋮ Feedback vertex set on Hamiltonian graphs ⋮ A multistage view on 2-satisfiability ⋮ Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs ⋮ Approximating multistage matching problems ⋮ A faster parameterized algorithm for temporal matching ⋮ A simple rounding scheme for multistage optimization ⋮ Target-based computer-assisted orchestration: complexity and approximation algorithms ⋮ LP-based algorithms for multistage minimization problems
This page was built for publication: Multistage Vertex Cover
