Karin Oberlechner

Recent Publications

A Branch-and-Cut-and-Price Algorithm for a Fingerprint-Template Compression Application
Proceedings of the 2011 Federated Conference on Computer Science and Information Systems (FedCSIS) (M. Ganzha and others), pages 239-246, 2011, IEEE Digital Library.
Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods
August 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and A.~Chwatal
Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates
Journal of Mathematical Modelling and Algorithms, volume 8, number 3, pages 293-334, 2009.
Note: previous technical report version at https://www.ac.tuwien.ac.at/files/pub/chwatal-08a.pdf
Solving an Extended Minimum Label Spanning Tree Problem to Compress Fingerprint Templates
September 2008, Technical report TR 186-1-08-01, Vienna University of Technology, Institute of Computer Graphics and Algorithms.