Graph Orientation Algorithms to Minimize the Maximum Outdegree

Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei Zenmyo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We study the problem of orienting the edges of a weighted graph such that the maximum weighted out- degree of vertices is minimized. This problem, which has applications in the guard arrangement for ex-ample, can be shown to be NP-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, or more generally, a graph with identically weighted edges, and (ii) the input graph is a tree. Then, by using those algorithms as sub-procedures, we provide a sim-ple, combinatorial, min{wmax/wmin ; (2-ε)g-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
Title of host publicationTheory of Computing 2006 - Proceedings of the 12th Computing
Subtitle of host publicationThe Australasian Theory Symposium, CATS 2006
Volume51
Publication statusPublished - Dec 1 2006
EventTheory of Computing 2006 - 12th Computing: The Australasian Theory Symposium, CATS 2006 - Hobart, TAS, Australia
Duration: Jan 16 2006Jan 19 2006

Other

OtherTheory of Computing 2006 - 12th Computing: The Australasian Theory Symposium, CATS 2006
CountryAustralia
CityHobart, TAS
Period1/16/061/19/06

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Graph Orientation Algorithms to Minimize the Maximum Outdegree'. Together they form a unique fingerprint.

Cite this