Directed Network Design with Orientation Constraints

DOI10.1137/S0895480100380112zbMath1086.68057OpenAlexW2087569883MaRDI QIDQ5317612

Joseph (Seffi) Naor, Sanjeev Khanna, F. Bruce Shepherd

Publication date: 16 September 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480100380112

zbMATH Keywords

connectivityorientationapproximation algorithmssubmodular flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (4)

On reachability mixed arborescence packing ⋮ Approximating Minimum Cost Connectivity Orientation and Augmentation ⋮ A Survey on Covering Supermodular Functions ⋮ The complexity of the proper orientation number

This page was built for publication: Directed Network Design with Orientation Constraints