Abstract
The goal of an outdegree-constrained edge-modification problem is to find a spanning subgraph or supergraph H of an input undirected graph G such that either: (Type I) the number of edges in H is minimized or maximized and H can be oriented to satisfy some specified constraints on the vertices’ resulting outdegrees; or: (Type II) the maximum or minimum outdegree of all vertices under an optimal orientation of H is minimum or maximum among all subgraphs or supergraphs of G that can be constructed by deleting or inserting a fixed number of edges. This paper introduces eight new outdegree-constrained edge-modification problems related to load balancing called (Type I) MIN-DEL-MAX, MIN-INS-MIN, MAX-INS-MAX, and MAX-DEL-MIN and (Type II) p-DEL-MAX, p-INS-MIN, p-INS-MAX, and p-DEL-MIN. We first present a framework that provides algorithms for solving all eight problems in polynomial time on unweighted graphs. Next we investigate the inapproximability of the edge-weighted versions of the problems, and design polynomial-time algorithms for six of the problems on edge-weighted trees.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Asahiro, Y., Jansson, J., Miyano, E., Nikpey, H., Ono, H.: Graph orientation with splits. In: Lee, J., Rinaldi, G., Mahjoub, A.R. (eds.) ISCO 2018. LNCS, vol. 10856, pp. 52–63. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96151-4_5
Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Graph orientation to maximize the minimum weighted outdegree. Int. J. Found. Comput. Sci. 22(3), 583–601 (2011)
Asahiro, Y., Jansson, J., Miyano, E., Ono, H.: Graph orientations optimizing the number of light or heavy vertices. J. Graph Algorithms Appl. 19(1), 441–465 (2015)
Asahiro, Y., Jansson, J., Miyano, E., Ono, H., Zenmyo, K.: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1), 78–96 (2011)
Asahiro, Y., Miyano, E., Ono, H.: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree. Discrete Appl. Math. 159, 498–508 (2011)
Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56, 89–113 (2004)
Borradaile, G., Iglesias, J., Migler, T., Ochoa, A., Wilfong, G., Zhang, L.: Egalitarian graph orientations. J. Graph Algorithms Appl. 21(4), 687–708 (2017)
Brodal, G.S., Fagerberg, R.: Dynamic representations of sparse graphs. In: Dehne, F., Sack, J.-R., Gupta, A., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 342–351. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48447-7_34
Cornuéjols, G.: General factors of graphs. J. Comb. Theory Ser. B 45, 185–198 (1988)
Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci. 86(2), 243–266 (1991)
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)
Lovász, L.: The factorization of graphs. In: Combinatorial Structures and Their Applications, pp. 243–246 (1970)
Lovász, L.: The factorization of graphs II. Acta Math. Acad. Sci. Hung. 23, 223–246 (1972)
Orlin, J.B.: Max flows in \(O(nm)\) time, or better. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC 2013), pp. 765–774. Association for Computing Machinery (ACM) (2013)
Sharan, R.: Graph modification problems and their applications to genomic research. Ph.D. thesis, School of Computer Science, Tel-Aviv University (2002)
Venkateswaran, V.: Minimizing maximum indegree. Discrete Appl. Math. 143, 374–378 (2004)
Acknowledgments
This work was partially supported by JSPS KAKENHI Grant Numbers JP17K00016 and JP17K00024, and JST CREST JPMJR1402.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Asahiro, Y., Jansson, J., Miyano, E., Ono, H., T. P., S. (2019). Graph Orientation with Edge Modifications. In: Chen, Y., Deng, X., Lu, M. (eds) Frontiers in Algorithmics. FAW 2019. Lecture Notes in Computer Science(), vol 11458. Springer, Cham. https://doi.org/10.1007/978-3-030-18126-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-18126-0_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18125-3
Online ISBN: 978-3-030-18126-0
eBook Packages: Computer ScienceComputer Science (R0)