English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Conflict-free Coloring for Rectangle Ranges using O(n.382) Colors

MPS-Authors
/persons/resource/persons43983

Ajwani,  Deepak
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44374

Elbassioni,  Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44512

Govindarajan,  Sathish
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45269

Ray,  Saurabh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Ajwani, D., Elbassioni, K., Govindarajan, S., & Ray, S. (2007). Conflict-free Coloring for Rectangle Ranges using O(n.382) Colors. In SPAA'07 (pp. 181-187). New York, NY: ACM. doi:10.1145/1248377.1248406.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-1EB3-D
Abstract
There is no abstract available