Distributed Algorithms for Unidirectional Networks
SIAM Journal on Computing
Orienting graphs to optimize reachability
Information Processing Letters
A note on orientations of mixed graphs
Discrete Applied Mathematics
Routing performance in the presence of unidirectional links in multihop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
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
Self-Stabilizing Unidirectional Network Algorithms by Power Supply
Self-Stabilizing Unidirectional Network Algorithms by Power Supply
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)
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
Improved orientations of physical networks
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
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
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that admit a directed source-target path. This problem has recently arisen in the study of biological networks, and it also has applications in communication networks. In this paper, we identify an interesting local-to-global orientation property. This property enables us to modify the best known algorithms for maximum mixed graph orientation and some of its special structured instances, due to Elberfeld et al. (CPM '11), and obtain improved approximation ratios. We further proceed by developing an algorithm that achieves an even better approximation guarantee for the general setting of the problem. Finally, we study several well-motivated variants of this orientation problem.