Constructing interference-minimal networks

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

Constructing interference-minimal networks

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

Algorithms

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

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 language	English
Title of host publication	Abstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005)
Editors	M.T. Berg, de
Place of Publication	Eindhoven
Publisher	Technische Universiteit Eindhoven
Pages	203-206
Publication status	Published - 2005

Cite this

@inproceedings{bee72ba2b02d405198870278f19f6e13,

title = "Constructing interference-minimal networks",

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.",

author = "M. Benkert and J. Gudmundsson and H.J. Haverkort and A. Wolff",

year = "2005",

language = "English",

pages = "203--206",

editor = "{Berg, de}, M.T.",

booktitle = "Abstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005)",

publisher = "Technische Universiteit Eindhoven",

}

Constructing interference-minimal networks. / Benkert, M.; Gudmundsson, J.; Haverkort, H.J. et al.

Abstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005). ed. / M.T. Berg, de. Eindhoven : Technische Universiteit Eindhoven, 2005. p. 203-206.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

TY - GEN

T1 - Constructing interference-minimal networks

AU - Benkert, M.

AU - Gudmundsson, J.

AU - Haverkort, H.J.

AU - Wolff, A.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 203

EP - 206

BT - Abstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005)

A2 - Berg, de, M.T.

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -

Constructing interference-minimal networks

Abstract

Fingerprint

Cite this