Constructing interference-minimal networks

M. Benkert, J. Gudmundsson, H.J. Haverkort, A. Wolff

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

Abstract

We consider the problem of producing interference-minimal graphs with additional properties such as connectivity, bounded stretch factor or bounded link diameter. We compute exact interference-minimal graphs and estimated interference-minimal graphs. The latter can be computed faster.
Original languageEnglish
Title of host publicationAbstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005)
EditorsM.T. Berg, de
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Pages203-206
Publication statusPublished - 2005

Fingerprint

Dive into the research topics of 'Constructing interference-minimal networks'. Together they form a unique fingerprint.

Cite this