scientific article; zbMATH DE number 2119674
From MaRDI portal
Publication:4828945
zbMath1093.68625MaRDI QIDQ4828945
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (13)
Approximation hardness of edge dominating set problems ⋮ An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set ⋮ Minimum-Cost $$b$$-Edge Dominating Sets on Trees ⋮ Graph covering using bounded size subgraphs ⋮ Approximation algorithms for partially covering with edges ⋮ Approximability of the capacitated \(b\)-edge dominating set problem ⋮ Generalizing the induced matching by edge capacity constraints ⋮ Minimum-cost \(b\)-edge dominating sets on trees ⋮ Linear time algorithms for generalized edge dominating set problems ⋮ Path hitting in acyclic graphs ⋮ New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition ⋮ Tight inapproximability of minimum maximal matching on bipartite graphs and related problems ⋮ On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem
This page was built for publication:
