Karin Oberlechner

Recent Publications

Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods
Karin Oberlechner
August 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and A.~Chwatal
PDF Cite
Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates
Andreas M. Chwatal, Günther Raidl, Karin Oberlechner
Journal of Mathematical Modelling and Algorithms, volume 8, number 3, pages 293-334, 2009.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/chwatal-08a.pdf
Cite
Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates
Andreas M. Chwatal, Günther Raidl, Karin Oberlechner
September 2008, Technical report TR 186-1-08-01, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
PDF Cite