Degree-constrained graph orientation: Maximum satisfaction and minimum violation

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

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

3 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationApproximation and Online Algorithms - 11th International Workshop, WAOA 2013, Revised Selected Papers
PublisherSpringer Verlag
Number of pages13
ISBN (Print)9783319080000
Publication statusPublished - 1 Jan 2013
Externally publishedYes
Event11th International Workshop on Approximation and Online Algorithms, WAOA 2013 - Sophia Antipolis, France
Duration: 5 Sept 20136 Sept 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8447 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th International Workshop on Approximation and Online Algorithms, WAOA 2013
CitySophia Antipolis

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Degree-constrained graph orientation: Maximum satisfaction and minimum violation'. Together they form a unique fingerprint.

Cite this