Degree-constrained graph orientation: Maximum satisfaction and minimum violation

Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

3 被引用数 (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.

ホスト出版物のタイトルApproximation and Online Algorithms - 11th International Workshop, WAOA 2013, Revised Selected Papers
出版社Springer Verlag
出版ステータス出版済み - 2014
イベント11th International Workshop on Approximation and Online Algorithms, WAOA 2013 - Sophia Antipolis, フランス
継続期間: 9 5 20139 6 2013


名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
8447 LNCS


その他11th International Workshop on Approximation and Online Algorithms, WAOA 2013
CitySophia Antipolis

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Degree-constrained graph orientation: Maximum satisfaction and minimum violation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。