New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set

Abstract

An edge dominating set in a graph G = (V, E) is a subset S of edges such that each edge in E − S is adjacent to at least one edge in S. The edge dominating set problem, to find an edge dominating set of minimum size, is a basic and important NP-hard problem that has been extensively studied in approximation algorithms and parameterized complexity. In this… (More)
DOI: 10.1007/s00224-014-9549-5

Topics

1 Figure or Table

Slides referencing similar topics