Approximation algorithms for orienting mixed graphs
From MaRDI portal
Publication:390889
DOI10.1016/j.tcs.2012.03.044zbMath1296.05184OpenAlexW2172997278MaRDI QIDQ390889
Colin R. Davidson, Michael Elberfeld, Danny Segev, Roded Sharan, Dana Silverbush
Publication date: 9 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.044
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Systems biology, networks (92C42)
Related Items (2)
On 2-strong connectivity orientations of mixed graphs and related problems ⋮ Improved approximation for orienting mixed graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orienting graphs to optimize reachability
- Improved algorithms for feedback vertex set problems
- A note on finding the bridges of a graph
- Parametrized complexity theory.
- On the Approximability of Reachability-Preserving Network Orientations
- Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
- Set connectivity problems in undirected graphs and the directed steiner network problem
- Strongly connected orientations of mixed multigraphs
- Robbins's Theorem for Mixed Multigraphs
- The Structure and Function of Complex Networks
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Improved Orientations of Physical Networks
- Approximation Algorithms for Directed Steiner Problems
- Reducibility among Combinatorial Problems
- Some optimal inapproximability results
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- A note on orientations of mixed graphs
This page was built for publication: Approximation algorithms for orienting mixed graphs
