Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods

Oberlechner, Karin

by Karin Oberlechner

Reference:

Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic MethodsKarin OberlechnerAug 2010, Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.Note: supervised by G. Raidl and A. Chwatal

Bibtex Entry:

@mastersthesis{oberlechner_10,
  author = {Karin Oberlechner},
  title = {Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods},
  school = {Vienna University of Technology, Institute of Computer Graphics and Algorithms},
  month = Aug,
  year = {2010},
  url = {https://www.ac.tuwien.ac.at/files/pub/oberlechner_10.pdf},
  note = {supervised by G.~Raidl and A.~Chwatal},
keywords = {netdesign},
}