Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation
- 398 Downloads
A degree-constrained graph orientation of an undirected graph G is an assignment of a direction to each edge in G such that the outdegree of every vertex in the resulting directed graph satisfies a specified lower and/or upper bound. Such graph orientations have been studied for a long time and various characterizations of their existence are known. In this paper, we consider four related optimization problems introduced in reference (Asahiro et al. LNCS 7422, 332–343 (2012)): For any fixed non-negative integer W, the problems MAX W-LIGHT, MIN W-LIGHT, MAX W-HEAVY, and MIN W-HEAVY take as input an undirected graph G and ask for an orientation of G that maximizes or minimizes the number of vertices with outdegree at most W or at least W. As shown in Asahiro et al. LNCS 7422, 332–343 (2012)).
KeywordsGraph orientation Degree constraint (In)approximability Submodular function Greedy algorithm
This work was supported by KAKENHI grant numbers 23500020, 25104521, 25330018, 26330017, and 26540005 and The Hakubi Project at Kyoto University. The authors would like to thank the anonymous reviewers for their detailed comments and suggestions that helped to improve the presentation of the paper, and Peter Floderus for pointing out an error in one of the figures.
- 1.Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows. Prentice Hall (1993)Google Scholar
- 4.Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Upper and lower degree bounded graph orientation with minimum penalty. In: Proceedings of CATS 2012. CRPIT Series 128, 139–146 (2012)Google Scholar
- 13.Frank, A.: Connections in Combinatorial Optimization. Oxford University Press (2011)Google Scholar
- 14.Frank, A., Gyárfás, A.: How to orient the edges of a graph? Combinatorics Volume I, North-Holland, 353–364 (1978)Google Scholar
- 15.Gabow, H.N.: Upper degree-constrained partial orientations. In: Proceedings of SODA 2006, 554–563 (2006)Google Scholar
- 23.Orlin, J.B.: Max flows in O(n m) time, or better. In: Proceedings of STOC 2013, 765–774 (2013)Google Scholar
- 25.Schrijver, A.: Combinatorial Optimization. Springer (2003)Google Scholar
- 27.Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of STOC 2001, 453–461(2001)Google Scholar