Online conflict-free colorings for hypergraphs

Bar-Noy, A; Cheilaris, P; Olonetsky, S; Smorodinsky, S

dc.contributor.author	Bar-Noy, A	en
dc.contributor.author	Cheilaris, P	en
dc.contributor.author	Olonetsky, S	en
dc.contributor.author	Smorodinsky, S	en
dc.date.accessioned	2014-03-01T02:51:08Z
dc.date.available	2014-03-01T02:51:08Z
dc.date.issued	2007	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35397
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-38149066745&partnerID=40&md5=0947127aa255e1bdf242c3324e2db4b9	en
dc.subject.other	Asymptotically optimal	en
dc.subject.other	Conflict free colorings	en
dc.subject.other	Algorithms	en
dc.subject.other	Geometry	en
dc.subject.other	Optimal systems	en
dc.subject.other	Random processes	en
dc.subject.other	Online systems	en
dc.title	Online conflict-free colorings for hypergraphs	en
heal.type	conferenceItem	en
heal.publicationDate	2007	en
heal.abstract	We provide a framework for online conflict-free coloring (CFcoloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring any k-degenerate hypergraph. Our algorithm uses O(k log n) colors with high probability and this bound is asymptotically optimal for any constant k. Moreover, our algorithm uses O(k log k log n) random bits with high probability. As a corollary, we obtain asymptotically optimal randomized algorithms for online CF-coloring some hypergraphs that arise in geometry. Our algorithm uses exponentially fewer random bits compared to previous results. We introduce deterministic online CF-coloring algorithms for points on the line with respect to intervals and for points on the plane with respect to halfplanes (or unit discs) that use ⊖(logn) colors and recolor O(n) points in total. © Springer-Verlag Berlin Heidelberg 2007.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.volume	4596 LNCS	en
dc.identifier.spage	219	en
dc.identifier.epage	230	en