• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

New Results on Polynomial Inapproximability and Fixed Parameter Approximability of Edge Dominating Set

Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis; Xiao, Mingyu (2015), New Results on Polynomial Inapproximability and Fixed Parameter Approximability of Edge Dominating Set, Theory of Computing Systems, 56, 2, p. 330-346. 10.1007/s00224-014-9549-5

View/Open
Ipec_EDS.pdf (183.3Kb)
Type
Article accepté pour publication ou publié
Date
2015
Journal name
Theory of Computing Systems
Volume
56
Number
2
Publisher
Springer
Pages
330-346
Publication identifier
10.1007/s00224-014-9549-5
Metadata
Show full item record
Author(s)
Escoffier, Bruno
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Monnot, Jérôme cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Paschos, Vangelis
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Xiao, Mingyu
School of Computer Science and Engineering
Abstract (EN)
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 paper, we present improved hardness results and parameterized approximation algorithms for edge dominating set. More precisely, we first show that it is NP-hard to approximate edge dominatingset in polynomial time within a factor better than 1.18. Next, we give a parameterized approximation schema (with respect to the standard parameter) for the problem and, finally, we develop an O ∗(1.821 τ )-time exact algorithm where τ is the size of a minimum vertex cover of G.
Subjects / Keywords
Edge dominating set; Parameterized complexity; Approximation algorithms

Related items

Showing items related by title and author.

  • Thumbnail
    Weighted coloring: further complexity and approximability results 
    Paschos, Vangelis; Escoffier, Bruno; Monnot, Jérôme (2006) Article accepté pour publication ou publié
  • Thumbnail
    Weighted coloring: further complexity and approximability results 
    Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis (2005) Communication / Conférence
  • Thumbnail
    Subexponential and FPT-time Inapproximability of Independent Set and Related Problems 
    Escoffier, Bruno; Kim, Eun Jung; Paschos, Vangelis (2012) Document de travail / Working paper
  • Thumbnail
    Complexity and approximation results for the min weighted node coloring problem 
    Escoffier, Bruno; Demange, Marc; Paschos, Vangelis; de Werra, Dominique; Monnot, Jérôme (2008) Chapitre d'ouvrage
  • Thumbnail
    Weighted edge coloring 
    Escoffier, Bruno; Demange, Marc; de Werra, Dominique; Milis, Ioannis; Lucarelli, Giorgio; Paschos, Vangelis; Monnot, Jérôme (2008) Chapitre d'ouvrage
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo