Route-Enabling Graph Orientation Problems
- 284 Downloads
Given an undirected and edge-weighted graph G together with a set of ordered vertex-pairs, called st-pairs, we consider two problems of finding an orientation of all edges in G: min-sum orientation is to minimize the sum of the shortest directed distances between all st-pairs; and min-max orientation is to minimize the maximum shortest directed distance among all st-pairs. Note that these shortest directed paths for st-pairs are not necessarily edge-disjoint. In this paper, we first show that both problems are strongly NP-hard for planar graphs even if all edge-weights are identical, and that both problems can be solved in polynomial time for cycles. We then consider the problems restricted to cacti, which form a graph class that contains trees and cycles but is a subclass of planar graphs. Then, min-sum orientation is solvable in polynomial time, whereas min-max orientation remains NP-hard even for two st-pairs. However, based on LP-relaxation, we present a polynomial-time 2-approximation algorithm for min-max orientation. Finally, we give a fully polynomial-time approximation scheme (FPTAS) for min-max orientation on cacti if the number of st-pairs is a fixed constant.
KeywordsApproximation algorithm Cactus Dynamic programming Fully polynomial-time approximation scheme Graph orientation Planar graph Reachability
We thank the referees for their fruitful comments, one of which leads us to improvements of the hardness analyses for min-sum orientation.
- 7.Ito, T., Miyamoto, Y., Ono, H., Tamaki, H., Uehara, R.: Route-enabling graph orientation problems. In: Proc. of the 20th Annual International Symposium on Algorithms and Computation (ISAAC 2009). LNCS, vol. 5878, pp. 403–412. Springer, Berlin (2009) Google Scholar
- 10.Medvedovsky, A., Bafna, V., Zwick, U., Sharan, R.: An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks. In: Proc. of the 8th Workshop on Algorithms in Bioinformatics (WABI 2008). LNBI, vol. 5251, pp. 222–232 (2008) Google Scholar
- 14.Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001) Google Scholar