Improved Approximation for Orienting Mixed Graphs

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. (Theor. Comput. Sci. 483:96–103, 2013), 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.

[1]  Roded Sharan,et al.  On the Approximability of Reachability-Preserving Network Orientations , 2011, Internet Math..

[2]  Uriel Feige,et al.  Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[3]  W. Marsden.  I and J , 2012 .

[4]  Ryan O'Donnell,et al.  Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..

[5]  Roded Sharan,et al.  Improved Orientations of Physical Networks , 2010, WABI.

[6]  Yehuda Afek,et al.  Distributed Algorithms for Unidirectional Networks , 1994, SIAM J. Comput..

[7]  Raffaele Giancarlo,et al.  Speeding up the Consensus Clustering methodology for microarray data analysis , 2011, Algorithms for Molecular Biology.

[8]  Uri Zwick,et al.  Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems , 2002, IPCO.

[9]  Mahesh K. Marina,et al.  Routing performance in the presence of unidirectional links in multihop wireless networks , 2002, MobiHoc '02.

[10]  Piotr Berman,et al.  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..

[11]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[12]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[13]  Esther M. Arkin,et al.  A note on orientations of mixed graphs , 2002, Discret. Appl. Math..

[14]  S. Louis Hakimi,et al.  Orienting Graphs to Optimize Reachability , 1997, Inf. Process. Lett..

[15]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[16]  Roded Sharan,et al.  An Algorithm for Orienting Graphs Based on Cause-Effect Pairs and Its Applications to Orienting Protein Networks , 2008, WABI.

[17]  Rolf Niedermeier,et al.  Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs , 2011, TAPAS.

[18]  Tommi S. Jaakkola,et al.  Physical Network Models , 2004, J. Comput. Biol..

[19]  Yehuda Afek,et al.  Self-stabilizing unidirectional network algorithms by power-supply , 1997, SODA '97.

[20]  Moti Medina,et al.  Improved Approximation for Orienting Mixed Graphs , 2012, SIROCCO.

[21]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[22]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[23]  Danny Segev,et al.  A Sublogarithmic Approximation for Highway and Tollbooth Pricing , 2010, ICALP.

[24]  Yehuda Afek,et al.  DISTRIBUTED ALGORITHMS FORUNIDIRECTIONAL NETWORKS , 1994 .

[25]  Donald B. Johnson,et al.  Generating and Searching Sets Induced by Networks , 1980, ICALP.

[26]  David P. Williamson,et al.  A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs , 1998, Oper. Res. Lett..

[27]  Roded Sharan,et al.  Approximation algorithms for orienting mixed graphs , 2011, Theor. Comput. Sci..

[28]  David Zuckerman.  Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..

[29]  Roded Sharan,et al.  Optimally Orienting Physical Networks , 2011, RECOMB.

[30]  Dan Geiger,et al.  Approximation Algorithms for the Loop Cutset Problem , 1994, UAI.

[31]  S. Fields.  High‐throughput two‐hybrid analysis , 2005, The FEBS journal.

[32]  Rolf Niedermeier,et al.  Exploiting bounded signal flow for graph orientation based on cause-effect pairs , 2011, Algorithms for Molecular Biology.

[33]  P. Bork,et al.  Functional organization of the yeast proteome by systematic analysis of protein complexes , 2002, Nature.

[34]  Roded Sharan,et al.  Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations , 2012, CPM.