Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
type: Item
instance of: scholarly article
title: Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
zbMATH Open document ID: 1246.68167
author: Deepak Ajwani
author: Sathish Govindarajan
author: Saurabh Ray
author: Khaled Elbassioni
published in: Discrete \& Computational Geometry
publication date: 2012-08-13T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6065206
zbMATH Keywords: frequency assignment in wireless networks
zbMATH Keywords: conflict-free coloring
zbMATH Keywords: axis-parallel rectangles
zbMATH Keywords: boundary sets
zbMATH Keywords: monotone sequences
MaRDI profile type: Publication
full work available at URL: s00454-012-9425-5
OpenAlex ID: W1984121377
cites work: Coloring graphs with sparse neighborhoods
cites work: Q3601520
cites work: Q3601521
cites work: Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
cites work: Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
cites work: Conflict-Free Colorings of Rectangles Ranges
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: Online conflict-free coloring for intervals
cites work: Conflict-free coloring of points and simple regions in the plane
cites work: Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
cites work: Q5692720
cites work: On the chromatic number of some geometric hypergraphs
cites work: Conflict-Free Coloring and its Applications
DOI: 10.1007/S00454-012-9425-5
description: scientific article; zbMATH DE number 6065206