On the Approximability of Reachability-Preserving Network Orientations

DOI10.1080/15427951.2011.604554zbMath1245.68105OpenAlexW2083522899MaRDI QIDQ2909122

Vineet Bafna, Danny Segev, Roded Sharan, Uri Zwick, Iftah Gamzu, Dana Silverbush, Alexander Medvedovsky, Michael Elberfeld

Publication date: 29 August 2012

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1323367278

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Systems biology, networks (92C42)

Related Items (3)

Representation of functions on big data associated with directed graphs ⋮ Approximation algorithms for orienting mixed graphs ⋮ Improved approximation for orienting mixed graphs

This page was built for publication: On the Approximability of Reachability-Preserving Network Orientations