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
Generating and Searching Sets Induced by Networks
Proceedings of the 7th Colloquium on Automata, Languages and Programming
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)
Robust subgraphs for trees and paths
ACM Transactions on Algorithms (TALG)
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
A sublogarithmic approximation for highway and tollbooth pricing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
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 |
The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a maximum graph orientation problem, where given an undirected graph on n vertices and a collection of vertex pairs, the goal is to orient the edges of the graph so that a maximum number of pairs are connected by a directed path. We develop a novel approximation algorithm for this problem with a performance guarantee of O(log n/ log log n), improving on the current logarithmic approximation. In addition, motivated by interactions whose direction is pre-set, such as protein-DNA interactions, we extend our algorithm to handle mixed graphs, a major open problem posed by earlier work. In this setting, we show that a polylogarithmic approximation ratio is achievable under biologically-motivated assumptions on the sought paths.