On Fixed Cost k-Flow Problems

DOI10.1007/978-3-319-08001-7_5zbMath1417.90043OpenAlexW1551632811MaRDI QIDQ3188865

Rohit Khandekar, Zeev Nutov, Guy Kortsarz, Mohammad Taghi Hajiaghayi

Publication date: 2 September 2014

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08001-7_5

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Flows in graphs (05C21)

Related Items (2)

On the edge capacitated Steiner tree problem ⋮ The minimum vulnerability problem

This page was built for publication: On Fixed Cost k-Flow Problems