Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem

Berlakovich, Martin

by Martin Berlakovich

Reference:

Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree ProblemMartin BerlakovichJul 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.Note: supervised by G. Raidl and M. Ruthmair

Bibtex Entry:

@MastersThesis{berlakovich_10,
	author = {Martin Berlakovich},
	title = {{Multilevel Heuristiken f{\"u}r das Rooted Delay-Constrained Minimum Spanning Tree Problem}},
	school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
	year = {2010},
	month = Jul,
	address = {Vienna, Austria},
	note = {supervised by G.~Raidl and M.~Ruthmair},
keywords = {netdesign,hybrid},
	url = {https://www.ac.tuwien.ac.at/files/pub/berlakovich\_10.pdf},
}