Weakening the Online Adversary Just Enough to get Optimal Conflict-free Colorings for Intervals

A Bar-Noy; P Cheilaris; S Olonetsky; S Smorodinsky

Weakening the Online Adversary Just Enough to get Optimal Conflict-free Colorings for Intervals

A Bar-Noy
, P Cheilaris
, S Olonetsky
, S Smorodinsky

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Original language	English
Title of host publication	Proceedings Of The Nineteenth Annual Symposium On Parallelism In Algorithms And Architectures
Pages	194-195
Number of pages	2
State	Published - 2007

Keywords

Online algorithms
Cellular networks
Coloring
Conflict free
Frequency assignment

Cite this

@inproceedings{1261014ed9694264b06be1acc5f74017,

title = "Weakening the Online Adversary Just Enough to get Optimal Conflict-free Colorings for Intervals",

keywords = "Online algorithms, Cellular networks, Coloring, Conflict free, Frequency assignment",

author = "A Bar-Noy and P Cheilaris and S Olonetsky and S Smorodinsky",

year = "2007",

language = "English",

pages = "194--195",

booktitle = "Proceedings Of The Nineteenth Annual Symposium On Parallelism In Algorithms And Architectures",

}

TY - GEN

T1 - Weakening the Online Adversary Just Enough to get Optimal Conflict-free Colorings for Intervals

AU - Bar-Noy, A

AU - Cheilaris, P

AU - Olonetsky, S

AU - Smorodinsky, S

PY - 2007

Y1 - 2007

KW - Online algorithms

KW - Cellular networks

KW - Coloring

KW - Conflict free

KW - Frequency assignment

UR - https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=bgu-pure&SrcAuth=WosAPI&KeyUT=WOS:000266371200024&DestLinkType=FullRecord&DestApp=WOS

M3 - Conference contribution

SP - 194

EP - 195

BT - Proceedings Of The Nineteenth Annual Symposium On Parallelism In Algorithms And Architectures

ER -

Weakening the Online Adversary Just Enough to get Optimal Conflict-free Colorings for Intervals

Keywords

Other files and links

Cite this