Constrained flows in networks

The support of a flow x in a network is the subdigraph induced by the arcs uv for which x(uv)>0. We discuss a number of results on flows in networks where we put certain restrictions on structure of the support of the flow. Many of these problems are NP-hard because they generalize linkage proble...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 1010; p. 114702
Main Authors:	Bang-Jensen, J., Bessy, S., Picasarri-Arrieta, L.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 27.09.2024 Elsevier
Subjects:	(Arc-)disjoint paths with prescribed end vertices Acyclic digraph Approximation algorithm Combinatorics Flows Mathematics NP-complete problem Parameterised complexity Polynomial time algorithm (Arc-)disjoint paths with prescribed end vertices Acyclic digraph Polynomial time algorithm Parameterised complexity Flows NP-complete problem Approximation algorithm
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!