Scheduling of a smart antenna: Capacitated coloring of unit circular-arc graphs

Guy Even, Shimon Shahar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationCombinatorial and Algorithmic Aspects of Networking - Third Workshop, CAAN 2006, Revised Papers
Pages58-71
Number of pages14
DOIs
StatePublished - 2006
Event3rd Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2006 - Chester, United Kingdom
Duration: 2 Jul 20062 Jul 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4235 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2006
Country/TerritoryUnited Kingdom
CityChester
Period2/07/062/07/06

Keywords

  • Capacitated coloring
  • Scheduling with conflicts
  • Smart antennas
  • Unit circular-arc graphs

Fingerprint

Dive into the research topics of 'Scheduling of a smart antenna: Capacitated coloring of unit circular-arc graphs'. Together they form a unique fingerprint.

Cite this