Abstract
Given an 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. In this paper (1) we prove that the problem is strongly NP-hard if all edge weights belong to the set {1,k}, where k is any 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 polynomial time algorithm that approximates the general version of the problem within a factor 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 factor 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.
This work is partially supported by Grant-in-Aid for Scientific Research on Priority Areas No. 16092223, and by Grant-in-Aid for Young Scientists (B) No. 17700022, No. 18700014 and No. 18700015.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asahiro, Y., Miyano, E., Ono, H., Zenmyo, K.: Graph orientation algorithms to minimize the maximum outdegree. In: Proceedings of Computing: the Twelfth Australasian Theory Symposium (CATS 2006), pp. 11–20 (2006)
Biedl, T., Chan, T., Ganjali, Y., Hajiaghayi, M.T., Wood, D.R.: Balanced vertex-orderings of graphs. Discrete Applied Mathematics 48(1), 27–48 (2005)
Brodal, G.S., Fagerberg, R.: Dynamic Representations of Sparse Graphs. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 342–351. Springer, Heidelberg (1999)
Chvátal, V.: A combinatorial theorem in plane geometry. J. Combinatorial Theory, series B 18, 39–41 (1975)
Fomin, F.V., Matamala, M., Rapaport, I.: Complexity of approximating the oriented diameter of chordal graphs. J. Graph Theory 45(4), 255–269 (2004)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)
Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45(5), 783–797 (1998)
Kára, J., Kratochvíl, J., Wood, D.R.: On the complexity of the balanced vertex ordering problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 849–858. Springer, Heidelberg (2005)
Kowalik, L.: Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 557–566. Springer, Heidelberg (2006)
Lenstra, J.K., Shmoys, D.B.: Tardos, Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46(3), 259–271 (1990)
O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)
Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 2nd edn. Prentice-Hall, Englewood Cliffs (2002)
Schrijver, A.: Combinatorial Optimization. Springer, Heidelberg (2003)
Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: Ten open problems. J. Scheduling 2, 203–213 (1999)
Venkateswaran, V.: Minimizing maximum indegree. Discrete Applied Mathematics 143(1-3), 374–378 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Asahiro, Y., Jansson, J., Miyano, E., Ono, H., Zenmyo, K. (2007). Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree. In: Kao, MY., Li, XY. (eds) Algorithmic Aspects in Information and Management. AAIM 2007. Lecture Notes in Computer Science, vol 4508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72870-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-72870-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72868-9
Online ISBN: 978-3-540-72870-2
eBook Packages: Computer ScienceComputer Science (R0)