Graph orientation algorithms to minimize the maximum outdegree

Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo

Research output: Contribution to journalArticlepeer-review

28 Citations (Scopus)


This paper studies the problem of orienting all edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guard arrangement for example, can be shown to be AP-hard generally. In this paper we first give optimal orientation algorithms which run in polynomial time for the following special cases: (i) the input is an unweighted graph, and (ii) the input graph is a tree. Then, by using those algorithms as sub-procedures, we provide a simple, combinatorial, min{w max/wmin, (2 - ε)}-approximation algorithm for the general case, where wmax and wmin are the maximum and the minimum weights of edges, respectively, and ε is some small positive real number that depends on the input.

Original languageEnglish
Pages (from-to)197-215
Number of pages19
JournalInternational Journal of Foundations of Computer Science
Issue number2
Publication statusPublished - Apr 2007

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)


Dive into the research topics of 'Graph orientation algorithms to minimize the maximum outdegree'. Together they form a unique fingerprint.

Cite this