Algorithms and complexity results for the capacitated vertex cover problem

DOI10.1007/978-3-030-10801-4_37zbMath1445.68178OpenAlexW2910676681MaRDI QIDQ2206252

Sebastiaan B. van Rooij, Johan M. M. van Rooij

Publication date: 22 October 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-10801-4_37

zbMATH Keywords

treewidthfixed-parameter tractabilityexact exponential-time algorithmscapacitated vertex cover

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items

Fast Algorithms for Join Operations on Tree Decompositions