Graph Orientations Optimizing the Number of Light or Heavy Vertices
This paper introduces four graph orientation problems named Maximize W -Light, Minimize W -Light, Maximize W -Heavy, and Minimize W -Heavy, where W can be any fixed non-negative integer. In each of these problems, the input is an undirected graph G and the objective is to assign a direction to each edge in G so that the number of vertices with outdegree at most W or at least W in the resulting directed graph is maximized or minimized. We derive a number of results on the computational complexity and polynomial-time approximability of these problems for different values of W and various special classes of graphs. In particular, we show that Maximize 0-Light and Minimize 1-Heavy are equivalent to Maximum Independent Set and Minimum Vertex Cover, respectively, so by allowing the value of W to vary, we obtain a new, natural generalization of the two latter problems.
KeywordsPlanar Graph Undirected Graph Vertex Cover Maximum Clique Chordal Graph
Unable to display preview. Download preview PDF.
- 4.Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proc. of STOC 2006, pp. 31–40. ACM (2006)Google Scholar
- 5.Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)Google Scholar
- 16.Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Transactions on Algorithms 5(4), Article 41 (2009)Google Scholar
- 17.Karp, R.M.: Reducibility among combinatorial problems. In: Proc. of Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85–103. Plenum Press (1972)Google Scholar
- 18.Schrijver, A.: Combinatorial Optimization. Springer (2003)Google Scholar