On the max min vertex cover Problem
From MaRDI portal
Publication:3188864
DOI10.1007/978-3-319-08001-7_4zbMath1416.68131OpenAlexW1548167816MaRDI QIDQ3188864
Vangelis Th. Paschos, Nicolas Boria, Frederico Della Croce
Publication date: 2 September 2014
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08001-7_4
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (7)
Maximum Minimal Vertex Cover Parameterized by Vertex Cover ⋮ The many facets of upper domination ⋮ Parameterized (in)approximability of subset problems ⋮ On the Complexity Landscape of the Domination Chain ⋮ Upper Domination: Complexity and Approximation ⋮ Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation ⋮ Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation
This page was built for publication: On the max min vertex cover Problem
