---
res:
  bibo_abstract:
  - 'Consider mitigating the effects of denial of service or of malicious traffic
    in networks by deleting edges. Edge deletion reduces the DoS or the number of
    the malicious flows, but it also inadvertently removes some of the desired flows.
    To model this important problem, we formulate two problems: (1) remove all the
    undesirable flows while minimizing the damage to the desirable ones and (2) balance
    removing the undesirable flows and not removing too many of the desirable flows.
    We prove these problems are equivalent to important theoretical problems, thereby
    being important not only practically but also theoretically, and very hard to
    approximate in a general network. We employ reductions to nonetheless approximate
    the problem and also provide a greedy approximation. When the network is a tree,
    the problems are still MAX SNP-hard, but we provide a greedy-based 2l-approximation
    algorithm, where l is the longest desirable flow. We also provide an algorithm,
    approximating the first and the second problem within {\$}{\$}2 {\backslash}sqrt{\{}
    2{\backslash}left| E {\backslash}right| {\}}{\$}{\$}and {\$}{\$}2 {\backslash}sqrt{\{}2
    ({\backslash}left| E {\backslash}right| + {\backslash}left| {\backslash}text {\{}undesirable
    flows{\}} {\backslash}right| ){\}}{\$}{\$}, respectively, where E is the set of
    the edges of the network. We also provide a fixed-parameter tractable (FPT) algorithm.
    Finally, if the tree has a root such that every flow in the tree flows on the
    path from the root to a leaf, we solve the problem exactly using dynamic programming.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Gleb
      foaf_name: Polevoy, Gleb
      foaf_surname: Polevoy
      foaf_workInfoHomepage: http://www.librecat.org/personId=83983
  - foaf_Person:
      foaf_givenName: Stojan
      foaf_name: Trajanovski, Stojan
      foaf_surname: Trajanovski
  - foaf_Person:
      foaf_givenName: Paola
      foaf_name: Grosso, Paola
      foaf_surname: Grosso
  - foaf_Person:
      foaf_givenName: Cees
      foaf_name: de Laat, Cees
      foaf_surname: de Laat
  dct_date: 2018^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/978-3-030-04651-4
  dct_language: eng
  dct_publisher: Springer International Publishing@
  dct_subject:
  - flow
  - Red-Blue Set Cover
  - Positive-Negative Partial Set Cover
  - approximation
  - tree
  - MAX SNP-hard
  - root
  - leaf
  - dynamic programming
  - FPT
  dct_title: Removing Undesirable Flows by Edge Deletion@
...