• 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 - No thumbnail

On the Complexity of Broadcast Domination and Multipacking in Digraphs

Foucaud, Florent; Gras, Benjamin; Perez, Anthony; Sikora, Florian (2020), On the Complexity of Broadcast Domination and Multipacking in Digraphs, in Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik, Combinatorial Algorithms - 31st International Workshop, Springer, p. 264-276. 10.1007/978-3-030-48966-3_20

Type
Communication / Conférence
External document link
https://hal.archives-ouvertes.fr/hal-02793880
Date
2020
Conference title
Combinatorial Algorithms, 31st International Workshop, IWOCA 2020
Conference date
2020
Conference country
FRANCE
Book title
Combinatorial Algorithms - 31st International Workshop
Book author
Leszek Gąsieniec, Ralf Klasing, Tomasz Radzik
Publisher
Springer
ISBN
978-3-030-48966-3
Pages
264-276
Publication identifier
10.1007/978-3-030-48966-3_20
Metadata
Show full item record
Author(s)
Foucaud, Florent
Gras, Benjamin
Perez, Anthony
Sikora, Florian cc
Abstract (EN)
We study the complexity of the two dual covering and packing distance-based problems Broadcast Domination and Multipacking in digraphs. A dominating broadcast of a digraph D is a function f:V(D)→N such that for each vertex v of D, there exists a vertex t with f(t)>0 having a directed path to v of length at most f(t). The cost of f is the sum of f(v) over all vertices v. A multipacking is a set S of vertices of D such that for each vertex v of D and for every integer d, there are at most d vertices from S within directed distance at most d from v. The maximum size of a multipacking of D is a lower bound to the minimum cost of a dominating broadcast of D. Let Broadcast Domination denote the problem of deciding whether a given digraph D has a dominating broadcast of cost at most k, and Multipacking the problem of deciding whether D has a multipacking of size at least k. It is known that Broadcast Domination is polynomial-time solvable for the class of all undirected graphs (that is, symmetric digraphs), while polynomial-time algorithms for Multipacking are known only for a few classes of undirected graphs. We prove that Broadcast Domination and Multipacking are both NP-complete for digraphs, even for planar layered acyclic digraphs of small maximum degree. Moreover, when parameterized by the solution cost/solution size, we show that the problems are respectively W[2]-hard and W[1]-hard. We also show that Broadcast Domination is FPT on acyclic digraphs, and that it does not admit a polynomial kernel for such inputs, unless the polynomial hierarchy collapses to its third level. In addition, we show that both problems are FPT when parameterized by the solution cost/solution size together with the maximum out-degree. Finally, we give for both problems polynomial-time algorithms for some subclasses of acyclic digraphs.
Subjects / Keywords
Broadcast domination; Dominating set; Multipacking; Directed graphs; Parameterized complexity

Related items

Showing items related by title and author.

  • Thumbnail
    On the Complexity of Broadcast Domination and Multipacking in Digraphs 
    Foucaud, Florent; Gras, Benjamin; Perez, Anthony; Sikora, Florian (2020) Article accepté pour publication ou publié
  • Thumbnail
    Complexity of Grundy Coloring and Its Variants 
    Bonnet, Édouard; Foucaud, Florent; Kim, Eun Jung; Sikora, Florian (2015) Communication / Conférence
  • Thumbnail
    Parameterized and approximation complexity of Partial VC Dimension 
    Bazgan, Cristina; Foucaud, Florent; Sikora, Florian (2019) Article accepté pour publication ou publié
  • Thumbnail
    Complexity of Grundy coloring and its variants 
    Bonnet, Édouard; Foucaud, Florent; Kim, Eun Jung; Sikora, Florian (2018) Article accepté pour publication ou publié
  • Thumbnail
    On the Approximability of Partial VC Dimension 
    Bazgan, Cristina; Foucaud, Florent; Sikora, Florian (2016) Communication / Conférence
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