Approximability of maximum splitting of k-sets and some other Apx-complete problems
Information Processing Letters
Orienting graphs to optimize reachability
Information Processing Letters
Some optimal inapproximability results
Journal of the ACM (JACM)
A note on orientations of mixed graphs
Discrete Applied Mathematics
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Improved orientations of physical networks
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Heuristic algorithms in computational molecular biology
Journal of Computer and System Sciences
Exploiting bounded signal flow for graph orientation based on cause-effect pairs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Optimally orienting physical networks
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Approximation algorithms for orienting mixed graphs
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Algorithmic aspects of heterogeneous biological networks comparison
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Series-parallel orientations preserving the cycle-radius
Information Processing Letters
Note: A note on the parameterized complexity of unordered maximum tree orientation
Discrete Applied Mathematics
Approximation algorithms and hardness results for shortest path based graph orientations
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Improved approximation for orienting mixed graphs
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Steiner forest orientation problems
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Approximation algorithms for orienting mixed graphs
Theoretical Computer Science
| Hi-index | 0.00 |
We consider a graph orientation problem arising in the study of biological networks. Given an undirected graph and a list of ordered source-target pairs, the goal is to orient the graph so that a maximum number of pairs will admit a directed path from the source to the target. We show that the problem is NP-hard and hard to approximate to within a constant ratio. We then study restrictions of the problem to various graph classes, and provide an O(logn) approximation algorithm for the general case. We show that this algorithm achieves very tight approximation ratios in practice and is able to infer edge directions with high accuracy on both simulated and real network data.