2026-09-20T14:55:45Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/81800 2023-07-11 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Har-Peled, Sariel Chen, Ke 2015-09-25T20:20:30Z 2015-09-25T20:20:30Z 10000-01-01 2007 2007 In the last part, we present randomized algorithms for online conflict-free coloring of points in the plane, with respect to intervals, halfplanes, congruent disks, and nearly-equal axis-parallel rectangles. In all these cases, the coloring algorithms use O(log n) colors, with high probability. We also present the first efficient deterministic algorithm for the CF coloring of points in the plane with respect to nearly-equal axis-parallel rectangles, using O(log 12 n) colors. Made available in DSpace on 2015-09-25T20:20:30Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 3301113.pdf: 3259612 bytes, checksum: 2a93f4b6cbe69c4c658538814aefcbea (MD5) Previous issue date: 2007 Embargo set by: Seth Robbins for item 83081 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs U of I Only 102 p. Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007. http://hdl.handle.net/2142/81800 (MiAaPQ)AAI3301113 eng Computer Science Algorithms on Clustering, Orienteering, and Conflict -Free Coloring text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.