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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 1010; s. 114702
Hlavní autori:	Bang-Jensen, J., Bessy, S., Picasarri-Arrieta, L.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 27.09.2024 Elsevier
Predmet:	(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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!