On fixed cost \(k\)-flow problems

DOI10.1007/s00224-014-9572-6zbMath1332.90048MaRDI QIDQ260248

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

Publication date: 21 March 2016

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

Full work available at URL: https://doi.org/10.1007/s00224-014-9572-6

zbMATH Keywords

network design; approximation algorithms; fixed cost flow; group Steiner tree

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

90B10: Deterministic network models in operations research

68W25: Approximation algorithms

05C21: Flows in graphs