Abstract
We study the advice complexity of the online version of the Maximum Independent Set problem, restricted to the sparse, and bipartite graphs, respectively. We show that for sparse graphs, constant-sized advice is sufficient to obtain a constant competitive ratio, whereas for bipartite graphs, only competitive ratio Ω(log(n/a)/loglog(n/a)) can be obtained with an advice of size a > loglogn. However, competitive ratio O(logn) can be achieved with advice O(loglogn).







Similar content being viewed by others
Notes
Actually, the paper proves inapproximability of Maximum-Clique problem, where the aim is to find the subset of vertices with largest cardinality that form a clique. However, the two problems are obviously equivalent w.r.t. approximation.
Some works use a slightly relaxed definition by allowing an additive constant, i.e., the algorithm is c-competitive if there exists a constant α such that the cost of the worst-case output (for randomized algorithms the worst-case expected output) is at least 1/c⋅o p t − α.
A σ-bounded disc graph is an intersection graph of a set of discs in a plane, where the ratio of the radii of any two discs is at most σ.
although without any restrictions on the structure or size of the supergraph, one can always construct a “universal” supergraph that fools any deterministic algorithm; with randomized algorithms, however, the situation is more subtle (see [2])
As a remark we mention the lower bound 1.13747 logn colors needed for online coloring of bipartite graphs due to [3].
Since n is not known, a self-delimited encoding will be used, at a cost of small increase in the number of bits used.
note, however, that A d e t may behave differently afterwards
References
Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In: Stoc 1996, pp 531–540. ACM (1996)
Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with application to on-line circuit and optical routing. SIAM J. Comput. 36(2), 354–393 (2006)
Bianchi, M., Böckenhauer, H.-J., Hromkovic, J., Keller, L.: Online coloring of bipartite graphs with and without advice. Algorithmica 70(1), 92–111 (2014)
Böckenhauer, H.-J., Komm, D., Královic̆, R., Královic̆, R.: On the advice complexity of the k-server problem. In: ICALP 2011, LNCS, Vol. 6755, pp 207–218. Springer (2011)
Boöckenhauer, H.-J., Komm, D., Královic̆, R., Královic̆, R., Mömke, T.: On the advice complexity of online problems. In: ISAAC 2009 LNCS, Vol. 5878, pp 331–340. Springer (2009)
Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge Univ. Press (1998)
Caragiannis, I., Fishkin, A.V., Kaklamanis, C., Papaioannou, E.: Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs. Discret. Appl. Math. 155(2), 119–136 (2007)
Christodoulou, G., Zissimopoulos, V.: On-line maximum independent set in chordal graphs. J. Found. Comput. Decis. Sci. 30(4), 283–296 (2005)
Cieślik, I.: On-line graph coloring. Ph.D. Thesis, Jagiellonian University, Krakow, Poland (2004)
Demange, M., Paradon, X., Paschos, V.T.: On-line maximum-order induces hereditary subgraph problems. In: SOFSEM 2008 LNCS, Vol. 1963, pp 327–335. Springer (2000)
Dereniowski, D., Pelc, A.: Drawing maps with advice. J. Par. Distrib. Comput. 72(2), 132–143 (2012)
Dobrev, S., Královic̆, R., Pardubská, D.: Measuring the problem-relevant information in input. ITA 43(3), 585–613 (2009)
Ebenlendr, T., Sgall, J.: Semi-online preemptive scheduling: One algorithm for all variants. Theory Comput. Syst. 48(3), 577–613 (2011)
Emek, Y., Fraigniaud, P., Korman, A., Rosén, A.: Online computation with advice. Theor. Comput. Sci. 412(24), 2642–2656 (2011)
Escoffier, B., Paschos, V.T.: On-line models and algorithms for max independent set. RAIRO - Oper. Res. 40(02), 129–142 (2006). doi:10.1051/ro:2006014
Fraigniaud, P., Gavoille, C., Ilcinkas, D., Pelc, A.: Distributed computing with advice: information sensitivity of graph coloring. Distrib. Comput. 21(6), 395–403 (2009)
Fraigniaud, P., Ilcinkas, D., Pelc, A.: Tree exploration with advice. Inf. Comput. 206(11), 1276–1287 (2008)
Fraigniaud, P., Ilcinkas, D., Pelc, A.: Communication algorithms with advice. J. Comput. Syst. Sci. 76(3-4), 222–232 (2010)
Fraigniaud, P., Korman, A., Lebhar, E.: Local mst computation with short advice. Theory Comput. Syst. 47(4), 920–933 (2010)
Fusco, E.G., Pelc, A.: Trade-offs between the size of advice and broadcasting time in trees. Algorithmica 60(4), 719–734 (2011)
Gyárfás, A., Lehel, J.: On-line and first fit colorings of graphs. Journal of Graph Theory 12(2), 217–227 (1988). doi:10.1002/jgt.3190120212
Halldórsson, M.M.: Online coloring known graphs. In: SODA 1999, pp 917–918. ACM/SIAM
Halldórsson, M.M., Iwama, K., Miyazaki, S., Taketomi, S.: Online independent sets. Theor. Comput. Sci. 289(2), 953–962 (2002)
Håstad, J.: Clique is hard to approximate within n 1−ε. Acta Mathematica 182, 105–142 (1999) [ 10.1007/BF02392825]
Hromkovic̆, J., Královic̆, R., Královic̆, R.: Information complexity of online problems. In: Mfcs 2010 LNCS, Vol. 6281, pp 24–36. Springer (2010)
Ilcinkas, D., Kowalski, D.R., Pelc, A.: Fast radio broadcasting with advice. Theor. Comput. Sci. 411(14-15), 1544–1557 (2010)
Kubale, M.: Graph colorings. In: Contemporary Mathematics, Vol. 352. AMS (2004)
Lipton, R.J., Tomkins, A.: Online interval scheduling (1994) [http: //dl.acm.org/citation.cfm?id=314464.314506]
Randerath, B., Schiermeyer, I.: Vertex colouring and forbidden subgraphs - a survey. Graphs and Combinatorics 20(1), 1–40 (2004)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)
Acknowledgments
The authors acknowledge the support of the VEGA agency under the grants 1/0671/11, and 2/0136/12. The research originated at the “Mountains and Algorithms” workshop organized by Juraj Hromkovič in August, 2011. Preliminary version of the paper has been presented at WAOA 2012. We thank the anonymous reviewer for fruitful comments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dobrev, S., Královič, R. & Královič, R. Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs. Theory Comput Syst 56, 197–219 (2015). https://doi.org/10.1007/s00224-014-9592-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-014-9592-2