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

Ajwani, Deepak; Elbassioni, Khaled; Govindarajan, Sathish; Ray, Saurabh

doi:10.1007/s00454-012-9425-5

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

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

MPS-Authors

/persons/resource/persons44374

Elbassioni, Khaled
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 (restricted access)

There are currently no full texts shared for your IP range.

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. (2012). Conflict-free Coloring for Rectangle Ranges Using O(n.382) Colors. Discrete & Computational Geometry, 48(1), 39-52. doi:10.1007/s00454-012-9425-5.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-C4FC-D

Abstract

There is no abstract available