Advertisement

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation

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

Abstract

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 [4]: 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. The problems’ computational complexities vary with W. Here, we resolve several open questions related to their polynomial-time approximability and present a number of positive and negative results.

Keywords

Polynomial Time Greedy Algorithm Vertex Cover Input Graph Outerplanar 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)CrossRefzbMATHMathSciNetGoogle 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)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Upper and lower degree bounded graph orientation with minimum penalty. In: Proc. of CATS 2012. CRPIT Series, vol. 128, pp. 139–146 (2012)Google Scholar
  4. 4.
    Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Graph orientations optimizing the number of light or heavy vertices. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 332–343. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  5. 5.
    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)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Bafna, V., Berman, P., Fujito, T.: Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. In: Staples, J., Katoh, N., Eades, P., Moffat, A. (eds.) ISAAC 1995. LNCS, vol. 1004, pp. 142–151. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  7. 7.
    Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theoretical Computer Science 86(2), 243–266 (1991)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Chung, F.R.K., Garey, M.R., Tarjan, R.E.: Strongly connected orientations of mixed multigraphs. Networks 15(4), 477–484 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162(1), 439–485 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Ebenlendr, T., Krčál, M., Sgall, J.: Graph balancing: A special case of scheduling unrelated parallel machines. In: Proc. of SODA 2008, pp. 483–490 (2008), Journal version: Graph balancing: A special case of scheduling unrelated parallel machines. Algorithmica (June 2012) published online doi:10.1007/s00453-012-9668-9Google Scholar
  11. 11.
    Feige, U.: Approximating maximum clique by removing subgraphs. SIAM Journal on Discrete Mathematics 18(2), 219–225 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Frank, A., Gyárfás, A.: How to orient the edges of a graph? In: Combinatorics, vol. I, pp. 353–364. North-Holland (1978)Google Scholar
  13. 13.
    Gabow, H.N.: Upper degree-constrained partial orientations. In: Proc. of SODA 2006, 554–563 (2006)Google Scholar
  14. 14.
    Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. Journal of the ACM 45(5), 783–797 (1998)CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    Hakimi, S.L.: On the degrees of the vertices of a directed graph. Journal of the Franklin Institute 279(4), 290–308 (1965)CrossRefzbMATHMathSciNetGoogle 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.
    Kowalik, Ł.: Approximation scheme for lowest outdegree orientation and graph density measures. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 557–566. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  18. 18.
    King, V., Rao, S., Tarjan, R.E.: A faster deterministic maximum flow algorithm. J. Algorithms 23, 447–474 (1994)CrossRefMathSciNetGoogle Scholar
  19. 19.
    Landau, H.G.: On dominance relations and the structure of animal societies: III The condition for a score structure. Bulletin of Mathematical Biophysics 15(2), 143–148 (1953)CrossRefGoogle Scholar
  20. 20.
    Lovász, L.: Graph minor theory. Bulletin of the American Mathematical Society 43, 75–86 (2005)CrossRefGoogle Scholar
  21. 21.
    Nash-Williams, C., St, J.A.: On orientations, connectivity and odd-vertex-pairings in finite graphs. Canadian Journal of Mathematics 12(4), 555–567 (1960)CrossRefzbMATHGoogle Scholar
  22. 22.
    Orlin, J.B.: Max flows in O(nm) time, or better. In: Proc. of STOC 2013, pp. 765–774 (2013)Google Scholar
  23. 23.
    Picard, J.-C., Queyranne, M.: A network flow solution to some nonlinear 0-1 programming problems with application to graph theory. Networks 12, 141–159 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  24. 24.
    Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. The American Mathematical Monthly 46(5), 281–283 (1939)CrossRefGoogle Scholar
  25. 25.
    Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner’s conjecture. Journal of Combinatorial Theory Ser.B 92(2), 325–357 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  26. 26.
    Stanley, R.P.: Acyclic orientations of graphs. Discrete Mathematics 5(2), 171–178 (1973)CrossRefzbMATHMathSciNetGoogle Scholar
  27. 27.
    Schrijver, A.: Combinatorial Optimization. Springer (2003)Google Scholar
  28. 28.
    Vazirani, V.V.: Approximation Algorithms. Springer (2001)Google Scholar
  29. 29.
    Venkateswaran, V.: Minimizing maximum indegree. Discrete Applied Mathematics 143(1-3), 374–378 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  30. 30.
    Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering Problem. Combinatorica 2(4), 385–393 (1982)CrossRefzbMATHMathSciNetGoogle Scholar
  31. 31.
    Zuckerman, D.: Linear degree extractors and the inapproximability of Max Clique and Chromatic Number. Theory of Computing 3(1), 103–128 (2007)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

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