dc.contributor.author | Fotakis, D | en |
dc.contributor.author | Nikoletseas, S | en |
dc.contributor.author | Papadopoulou, V | en |
dc.contributor.author | Spirakis, P | en |
dc.date.accessioned | 2014-03-01T01:50:45Z | |
dc.date.available | 2014-03-01T01:50:45Z | |
dc.date.issued | 2001 | en |
dc.identifier.uri | https://dspace.lib.ntua.gr/xmlui/handle/123456789/26109 | |
dc.subject | Graph Coloring | en |
dc.subject | Radio Networks | en |
dc.subject | Frequency Assignment Problem | en |
dc.title | Hardness Results and Efficient Approximations for Frequency Assignment Problems: Radio Labelling and Radio Coloring | en |
heal.type | journalArticle | en |
heal.publicationDate | 2001 | en |
heal.abstract | The Frequency Assignment Problem (FAP) in radio networks is the problem of assigning frequencies to transmitters exploiting frequency reuse while keeping signal interference to acceptable levels. The FAP is usually modeled by variations of graph coloring. In this work we study two (similar but still different) frequency assignment problems: radio labelling and radio-coloring. For radio labelling we prove that it | en |
heal.journalName | Computing and Informatics / Computers and Artificial Intelligence | en |
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |