scientific article; zbMATH DE number 6823766

DOI10.4086/toc.2017.v013a020zbMath1387.68127arXiv1504.00627OpenAlexW2964263868MaRDI QIDQ4602397

Adrian Vetta, F. Bruce Shepherd

Publication date: 10 January 2018

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.00627

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsnetwork flowcomplexity theoryunsplittable flowmultiflowconfluent flowpriority flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows

This page was built for publication: