Please use this identifier to cite or link to this item:
For citation please use:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMüller-Hannemann, Matthias
dc.contributor.authorSchwartz, Alexander
dc.description.abstractWe present a case study on the design of an implementation of a fundamental combinatorial optimization problem: weighted b-matching. Although this problem is well-understood in theory and efficient algorithms are known, only little experience with implementations is available. This study was motivated by the practical need for an efficient b-matching solver as a subroutine in our approach to a mesh refinement problem in computer-aided design (CAD). The intent of this paper is to demonstrate the importance of flexibility and adaptability in the design of complex algorithms, but also to discuss how such goals can be achieved for matching algorithms by the use of design patterns. Starting from the basis of Pulleyblank's blossom algorithm we explain how to exploit in different ways the flexibility of our software design which allows an incremental improvement of efficiency by exchanging subalgorithms and data structures.en
dc.subject.ddc510 Mathematiken
dc.subject.otherblossom algorithmen
dc.subject.otherobject-oriented designen
dc.subject.otherdesign patternsen
dc.titleImplementing Weighted b-Matching Algorithms: Towards a Flexible Software Designen
dc.typeResearch Paperen
tub.publisher.universityorinstitutionTechnische Universität Berlinen
tub.series.issuenumber1998, 591en
tub.series.namePreprint-Reihe des Instituts für Mathematik, Technische Universität Berlinen
tub.affiliationFak. 2 Mathematik und Naturwissenschaften » Inst. Mathematikde
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Format: Adobe PDF | Size: 24.04 MB
DownloadShow Preview
Format: Postscript | Size: 1.19 MB

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.