Improved approximation for orienting mixed graphs

Iftah Gamzu, Moti Medina

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Scopus citations


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.

Original languageEnglish
Title of host publicationStructural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Proceedings
Number of pages11
StatePublished - 2012
Externally publishedYes
Event19th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2012 - Reykjavik, Iceland
Duration: 30 Jun 20122 Jul 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7355 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference19th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2012


Dive into the research topics of 'Improved approximation for orienting mixed graphs'. Together they form a unique fingerprint.

Cite this