Independence and Coloring Problems on Intersection Graphs of Disks [chapter]

Thomas Erlebach, Jiří Fiala
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
This chapter surveys on-line and approximation algorithms for the maximum independent set and coloring problems on intersection graphs of disks. It includes a more detailed treatment of recent upper and lower bounds on the competitive ratio of on-line algorithms for coloring such graphs.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11671541_5">doi:10.1007/11671541_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q7gquet6kraljam3wcoklhz6zm">fatcat:q7gquet6kraljam3wcoklhz6zm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070617173816/http://kam.mff.cuni.cz/%7Efiala/papers/2006EF.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c8/b5/c8b5c9b1be13f816921574323bd8d219fbd98b04.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11671541_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>