---
res:
  bibo_abstract:
  - Given the increasingly stringent requirements on the performance and efficiency
    of communication networks, over the last years, great efforts have been made to
    render networks more flexible and programmable. In particular, modern networks
    support a flexible rerouting of flows, e.g., depending on the dynamically changing
    traffic or network conditions. However, the underlying algorithmic problems are
    still not well-understood today.In this paper, we revisit the k-Network Flow Update
    problem that asks for a schedule to reroute k unsplittable flows from their current
    paths to the given new paths, in a congestion-free manner in a capacitated network.
    We show that the problem is already NP-hard for three acyclic flows on simple
    directed graphs. Our main contribution is an efficient algorithm for sparse networks;
    specifically the algorithm is fixed parameter tractable in the number of flows
    and the treewidth of a graph that is the union of all flows. Our results also
    settle the open complexity question in the literature.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Esra
      foaf_name: Ceylan, Esra
      foaf_surname: Ceylan
      foaf_workInfoHomepage: http://www.librecat.org/personId=cb1ca1d8-dcc0-11ef-baa5-9f1b3ef75933
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Stefan
      foaf_name: Schmid, Stefan
      foaf_surname: Schmid
  - foaf_Person:
      foaf_givenName: Jakub
      foaf_name: Svoboda, Jakub
      foaf_surname: Svoboda
      foaf_workInfoHomepage: http://www.librecat.org/personId=130759D2-D7DD-11E9-87D2-DE0DE6697425
    orcid: 0000-0002-1419-3267
  bibo_doi: 10.1109/noms59830.2024.10575579
  dct_date: 2024^xs_gYear
  dct_identifier:
  - UT:001270140300143
  dct_isPartOf:
  - http://id.crossref.org/issn/2374-9709
  - http://id.crossref.org/issn/9798350327946
  dct_language: eng
  dct_publisher: IEEE@
  dct_title: 'Congestion-free rerouting of network flows: Hardness and an FPT algorithm@'
...