A Hamiltonian Approach to the Assignment of Non-reusable Frequencies

Fotakis, D; Spirakis, P

dc.contributor.author	Fotakis, D	en
dc.contributor.author	Spirakis, P	en
dc.date.accessioned	2014-03-01T02:48:35Z
dc.date.available	2014-03-01T02:48:35Z
dc.date.issued	1998	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33922
dc.subject	Frequency Assignment	en
dc.subject	Polynomial Time	en
dc.title	A Hamiltonian Approach to the Assignment of Non-reusable Frequencies	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/b71635	en
heal.identifier.secondary	http://dx.doi.org/10.1007/b71635	en
heal.publicationDate	1998	en
heal.abstract	. The problem of Radio Labelling is to assign distinct integerlabels to all the vertices of a graph, such that adjacent vertices get labelsat distance at least two. The objective is to minimize the label span.Radio labelling is a combinatorial model for frequency assignment in casethat the transmitters are not allowed to operate at the same channel.We show that radio	en
heal.journalName	Foundations of Software Technology and Theoretical Computer Science	en
dc.identifier.doi	10.1007/b71635	en