scientific article
From MaRDI portal
Publication:2921716
zbMath1297.05189MaRDI QIDQ2921716
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (10)
A novel parameterised approximation algorithm for \textsc{minimum vertex cover} ⋮ Improved approximation for spanning star forest in dense graphs ⋮ Approximating vertex cover in dense hypergraphs ⋮ Connected Vertex Covers in Dense Graphs ⋮ Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs ⋮ Approximating Edge Dominating Set in Dense Graphs ⋮ Connected vertex covers in dense graphs ⋮ Improved approximation bounds for edge dominating set in dense graphs ⋮ Approximating edge dominating set in dense graphs ⋮ Approximating Subdense Instances of Covering Problems
This page was built for publication:
