Graph Orientations Optimizing the Number of Light or Heavy Vertices

  • Yuichi Asahiro
  • Jesper Jansson
  • Eiji Miyano
  • Hirotaka Ono
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7422)


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.


Planar Graph Undirected Graph Vertex Cover Maximum Clique Chordal Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Graph orientation to maximize the minimum weighted outdegree. International Journal of Foundations of Computer Science 22(3), 583–601 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Asahiro, Y., Jansson, J., Miyano, E., Ono, H., Zenmyo, K.: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. Journal of Combinatorial Optimization 22(1), 78–96 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Asahiro, Y., Miyano, E., Ono, H., Zenmyo, K.: Graph orientation algorithms to minimize the maximum outdegree. International Journal of Foundations of Computer Science 18(2), 197–215 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proc. of STOC 2006, pp. 31–40. ACM (2006)Google Scholar
  5. 5.
    Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)Google Scholar
  6. 6.
    Brodal, G.S., Fagerberg, R.: Dynamic Representations of Sparse Graphs. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 342–351. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  7. 7.
    Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Massachusetts (1990)zbMATHGoogle Scholar
  8. 8.
    Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162(1), 439–485 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Feige, U.: Approximating maximum clique by removing subgraphs. SIAM Journal on Discrete Mathematics 18(2), 219–225 (2004)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Garey, M., Johnson, D.: Computers and Intractability – A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)zbMATHGoogle Scholar
  11. 11.
    Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing 1(2), 180–187 (1972)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Gavril, F.: Testing for equality between maximum matching and minimum node covering. Information Processing Letters 6(6), 199–202 (1977)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. Journal of the ACM 45(5), 783–797 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Heath, L.S., Vergara, J.P.C.: Edge-packing in planar graphs. Theory of Computing Systems 31(6), 629–662 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2(4), 225–231 (1973)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Transactions on Algorithms 5(4), Article 41 (2009)Google Scholar
  17. 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. 18.
    Schrijver, A.: Combinatorial Optimization. Springer (2003)Google Scholar
  19. 19.
    Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory of Computing 3(1), 103–128 (2007)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yuichi Asahiro
    • 1
  • Jesper Jansson
    • 2
  • Eiji Miyano
    • 3
  • Hirotaka Ono
    • 4
  1. 1.Department of Information ScienceKyushu Sangyo UniversityHigashi-kuJapan
  2. 2.Laboratory of Mathematical Bioinformatics, Institute for Chemical ResearchKyoto UniversityUjiJapan
  3. 3.Department of Systems Design and InformaticsKyushu Institute of TechnologyIizukaJapan
  4. 4.Department of Economic EngineeringKyushu UniversityHigashi-kuJapan

Personalised recommendations