TY - JOUR

T1 - Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree

AU - Asahiro, Yuichi

AU - Jansson, Jesper

AU - Miyano, Eiji

AU - Ono, Hirotaka

AU - Zenmyo, Kouhei

N1 - Funding Information:
This work is partially supported by KAKENHI No. 16092223, No. 17700022, No. 18700015, No. 20500017 and No. 21680001, the Special Coordination Funds for Promoting Science and Technology, Asahi glass foundation and Inamori foundation.

PY - 2011/7

Y1 - 2011/7

N2 - Given a simple, undirected graph G = (V ,E) and a weight function w : E→ℤ+, we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all vertices is minimized. It has previously been shown that the unweighted version of the problem is solvable in polynomial time while the weighted version is (weakly) NP-hard. In this paper, we strengthen these results as follows: (1) We prove that the weighted version is strongly NP-hard even if all edge weights belong to the set {1, k}, where k is any fixed integer greater than or equal to 2, and that there exists no pseudo-polynomial time approximation algorithm for this problem whose approximation ratio is smaller than (1 + 1/k) unless P = NP; (2) we present a new polynomial-time algorithm that approximates the general version of the problem within a ratio of (2-1/k), where k is the maximum weight of an edge in G; (3) we show how to approximate the special case in which all edge weights belong to {1, k} within a ratio of 3/2 for k = 2 (note that this matches the inapproximability bound above), and (2 -2/(k +1)) for any k ≤ 3, respectively, in polynomial time.

AB - Given a simple, undirected graph G = (V ,E) and a weight function w : E→ℤ+, we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all vertices is minimized. It has previously been shown that the unweighted version of the problem is solvable in polynomial time while the weighted version is (weakly) NP-hard. In this paper, we strengthen these results as follows: (1) We prove that the weighted version is strongly NP-hard even if all edge weights belong to the set {1, k}, where k is any fixed integer greater than or equal to 2, and that there exists no pseudo-polynomial time approximation algorithm for this problem whose approximation ratio is smaller than (1 + 1/k) unless P = NP; (2) we present a new polynomial-time algorithm that approximates the general version of the problem within a ratio of (2-1/k), where k is the maximum weight of an edge in G; (3) we show how to approximate the special case in which all edge weights belong to {1, k} within a ratio of 3/2 for k = 2 (note that this matches the inapproximability bound above), and (2 -2/(k +1)) for any k ≤ 3, respectively, in polynomial time.

UR - http://www.scopus.com/inward/record.url?scp=79955053720&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955053720&partnerID=8YFLogxK

U2 - 10.1007/s10878-009-9276-z

DO - 10.1007/s10878-009-9276-z

M3 - Article

AN - SCOPUS:79955053720

VL - 22

SP - 78

EP - 96

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

SN - 1382-6905

IS - 1

ER -