@inproceedings{f69de25aee194327b3ac12a81f2544f8,

title = "Scheduling of a smart antenna: Capacitated coloring of unit circular-arc graphs",

abstract = "We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a conflict graph that specifies which messages cannot be transmitted concurrently. In our model the conflict graph is a unit circular-arc graph. Two variants of the problem are considered: c-mbl and nu-c-mbl. In c-mbl, the messages have unit demands, whereas in nu-c-mbl demands are arbitrary. We present an optimal algorithm for c-mbl and a 3-approximation algorithm for nu-c-mbl.",

keywords = "Capacitated coloring, Scheduling with conflicts, Smart antennas, Unit circular-arc graphs",

author = "Guy Even and Shimon Shahar",

year = "2006",

doi = "10.1007/11922377_6",

language = "אנגלית",

isbn = "3540488227",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "58--71",

booktitle = "Combinatorial and Algorithmic Aspects of Networking - Third Workshop, CAAN 2006, Revised Papers",

note = "null ; Conference date: 02-07-2006 Through 02-07-2006",

}