Export Citations
4 Results for: Keyword: conflict free
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,846,364 records)|Limit your search to The ACM Full-Text Collection (775,798 records)
Select All
- research-articleAugust 2008
Deterministic conflict-free coloring for intervals: From offline to online
ACM Transactions on Algorithms (TALG), Volume 4, Issue 4Article No.: 44, Pages 1–18https://doi.org/10.1145/1383369.1383375We investigate deterministic algorithms for a frequency assignment problem in cellular networks. The problem can be modeled as a special vertex coloring problem for hypergraphs: In every hyperedge there must exist a vertex with a color that occurs ...
- ArticleJuly 2006
Conflict-free coloring for intervals: from offline to online
SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architecturesPages 128–137https://doi.org/10.1145/1148109.1148133This paper studies deterministic algorithms for a frequency assignment problem in cellular networks. A cellular network consists of fixed-position base stations and moving agents. Each base station operates at a fixed frequency, and this allows an agent ...
