Upper and lower degree bounded graph orientation with minimum penalty

Yuichi Asahiro, Jesper Andreas Jansson, Eiji Miyano, Hirotaka Ono

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

13 Citations (Scopus)


Given an undirected graph G = (V,E), a graph orientation problem is to decide a direction for each edge so that the resulting directed graph G = (V, Λ(E)) satisfies a certain condition, where Λ(E) is a set of assignments of a direction to each edge {u, v} ∈ E. Among many conceivable types of conditions, we consider a degree constrained orientation: Given positive integers a v and b v for each v (a v ≤ b v), decide an orientation of G so that a v ≤ {pipe}{(v, u) ∈ Λ(E)}{pipe} ≤ b v holds for every v ∈ V. However, such an orientation does not always exist. In this case, it is desirable to find an orientation that best fits the condition instead. In this paper, we consider the problem of finding an orientation that minimizes Σ v∈Vcv, where c v is a penalty incurred for v's violating the degree constraint. As penalty functions, several classes of functions can be considered, e.g., linear functions, convex functions and concave functions. We show that the degree-constrained orientation with any convex (including linear) penalty function can be solved in O(m 1:5 min{Δ 0:5, log(nC)}), where n = {pipe}V{pipe},m = {pipe}E{pipe}, Δ and C are the maximum degree and the largest magnitude of a penalty, respectively. In contrast, it has no polynomial approximation algorithm whose approximation factor is better than 1.3606, for concave penalty functions, unless P=NP; it is APX-hard. This holds even for step functions, which are considered concave. For trees, the problem with any penalty functions can be solved exactly in O(n log Δ) time, and if the penalty function is convex, it is solvable in linear time.
Original languageEnglish
Title of host publicationTheory of Computing 2012 - Proceedings of the Eighteenth Computing
Subtitle of host publicationThe Australasian Theory Symposium, CATS 2012
Number of pages8
Publication statusPublished - 24 Jul 2012
Externally publishedYes
EventTheory of Computing 2012 - 18th Computing: The Australasian Theory Symposium, CATS 2012 - Melbourne, VIC, Australia
Duration: 31 Jan 20123 Feb 2012


ConferenceTheory of Computing 2012 - 18th Computing: The Australasian Theory Symposium, CATS 2012
CityMelbourne, VIC


  • Concave functions
  • Convex functions
  • Degree constraint
  • Graph orientation
  • Inapproximability

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture
  • Information Systems
  • Software


Dive into the research topics of 'Upper and lower degree bounded graph orientation with minimum penalty'. Together they form a unique fingerprint.

Cite this