Abstract
Motivated by placement of jobs in physical machines, we introduce and analyze the problem of online recoloring, or online disengagement. In this problem, we are given a set of n weighted vertices and a k-coloring of the vertices (vertices represent jobs, and colors represent physical machines). Edges, representing conflicts between jobs, are inserted in an online fashion. After every edge insertion, the algorithm must output a proper k-coloring of the vertices. The cost of recoloring a vertex is the vertex’s weight. Our aim is to minimize the competitive ratio of the algorithm, i.e., the ratio between the cost paid by the online algorithm and the cost paid by an optimal, offline algorithm. We consider a couple of polynomially-solvable coloring variants. Specifically, for 2-coloring bipartite graphs we present an \(O(\log n)\)-competitive deterministic algorithm and an \(\Omega (\log n)\) lower bound on the competitive ratio of randomized algorithms. For \((\Delta +1)\)-coloring, where \(\Delta \) is the maximal node degree, we present tight bounds of \(\Theta (\Delta )\) and \(\Theta (\log \Delta )\) on the competitive ratios of deterministic and randomized algorithms, respectively (where \(\Delta \) denotes the maximum degree). We also consider the fully dynamic case which allows edge deletions as well as insertions. All our algorithms are applicable to the case where vertices are arbitrarily weighted, and all our lower bounds hold even in the uniform weights (unweighted) case.
Similar content being viewed by others
Notes
We use the notation \([k]{\mathop {=}\limits ^\textrm{def}}\left\{ 1,2,\ldots ,k \right\} \).
In the case of weighted nodes, an algorithm for tight capacitated disengagement needs to solve the NP-hard problem of PARTITION [9] even when \(k=2\). Our lower bounds, however, apply to the unweighted nodes case, for which PARTITION is trivial.
References
Allybokus, Z., Perrot, N., Leguay, J., Maggi, L., Gourdin, E.: Virtual function placement for service chaining with partial orders and anti-affinity rules. Networks 71(2), 97–106 (2018)
Avin, C., Bienkowski, M., Loukas, A., Pacut, M., Schmid, S.: Dynamic balanced graph partitioning. SIAM J. Discrete Math. 34(3), 1791–1812 (2020)
Avin, C., Loukas, A., Pacut, M., Schmid, S.: Online balanced repartitioning. In: 30th International Symposium on Distributed Computing (DISC) (2016)
Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2(2), 198–203 (1981)
Barba, L., Cardinal, J., Korman, M., Langerman, S., van Renssen, A., Roeloffzen, M., Verdonschot, S.: Dynamic graph coloring. Algorithmica 81(4), 1319–1341 (2019)
Bartal, Y., Bollobas, B., Mendel, M.: A Ramsey-type theorem for metric spaces and its applications for metrical task systems and related problems. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 396–405 (2001)
Borodin, A., Linial, N., Saks, M.E.: An optimal on-line algorithm for metrical task system. J. ACM 39(4), 745–763 (1992)
Bosek, B., Disser, Y., Feldmann, A.E., Pawlewicz, J., Zych-Pawlewicz, A.: Recoloring interval graphs with limited recourse budget. In: Proceedings of 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020), volume 162 of Leibniz International Proceedings in Informatics (LIPIcs), 17:1–17:23, Dagstuhl, Germany (2020)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)
Halldórsson, M.M.: Parallel and on-line graph coloring. J. Algorithms 23(2), 265–280 (1997)
Halldórsson, M.M., Szegedy, M.: Lower bounds for on-line graph coloring. Theoret. Comput. Sci. 130(1), 163–174 (1994)
Henzinger, M., Neumann, S., Räcke, H., Schmid, S.: Tight bounds for online graph partitioning. In: Proceedings of the 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), pp. 2799–2818 (2021)
Henzinger, M., Neumann, S., Wiese, A.: Explicit and implicit dynamic coloring of graphs with bounded arboricity (2020). CoRR arXiv:2002.10142
Kashyop, M.J., Narayanaswamy, N.S., Nasre, M., Potluri, S.M.: Dynamic coloring for bipartite and general graphs (2019). CoRR, arXiv:1909.07854
Lovász, L., Saks, M., Trotter, W.T.: An on-line graph coloring algorithm with sublinear performance ratio. Discrete Math. 75(1–3), 319–325 (1989)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)
Solomon, S., Wein, N.: Improved dynamic graph coloring. ACM Trans. Algorithms 16(3), 1–24 (2020)
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3(6), 103–128 (2007)
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
We are not aware of any conflicts of interest regarding the research presented in this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Azar, Y., Machluf, C., Patt-Shamir, B. et al. Competitive Vertex Recoloring. Algorithmica 85, 2001–2027 (2023). https://doi.org/10.1007/s00453-022-01076-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-022-01076-x