Steiner Forest Orientation Problems

DOI10.1137/120883931zbMath1283.05257arXiv1112.2273MaRDI QIDQ5891382

Marek Cygan, Guy Kortsarz, Zeev Nutov

Publication date: 21 January 2014

Published in: SIAM Journal on Discrete Mathematics, Algorithms – ESA 2012 (Search for Journal in Brave)

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

zbMATH Keywords

graph algorithms; approximation algorithms; graph orientation; parameterized complexity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

05C20: Directed graphs (digraphs), tournaments

05C40: Connectivity