Constrained flows in networks
type: Item
instance of: scholarly article
title: Constrained flows in networks
author: Jørgen Bang-Jensen
author: Stéphane Bessy
author: L. Picasarri-Arrieta
published in: Theoretical Computer Science
publication date: 2024-08-20T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7898963
zbMATH Keywords: flows
zbMATH Keywords: (arc-)disjoint paths with prescribed end vertices
zbMATH Keywords: acyclic digraph
zbMATH Keywords: polynomial time algorithm
zbMATH Keywords: NP-complete problem
zbMATH Keywords: approximation algorithm
zbMATH Keywords: parameterised complexity
MaRDI profile type: Publication
cites work: Q3056948
cites work: The \(k\)-splittable flow problem
cites work: (Arc-)disjoint flows in networks
cites work: Digraphs
cites work: The complexity of finding arc-disjoint branching flows
cites work: Arc-disjoint spanning sub(di)graphs in digraphs
cites work: Balanced branchings in digraphs
cites work: FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs
cites work: Parameterized Algorithms
cites work: The complexity of computing a robust flow
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: The directed subgraph homeomorphism problem
cites work: Q4763417
cites work: Approximating the single source unsplittable min-cost flow problem
cites work: Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
DOI: 10.1016/J.TCS.2024.114702
description: scientific article; zbMATH DE number 7898963