Opening book details…
Can I read Implementing Weighted B-matching Algorithms: Towards a Flexible Software Design on EtoBox?
Implementing Weighted B-matching Algorithms: Towards a Flexible Software Design by M. Müller-Hannemann; A. Schwartz is a Computer Science article available to read on EtoBox.
What is Implementing Weighted B-matching Algorithms: Towards a Flexible Software Design about?
We 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 the famous 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.In a comparison with a code by Miller and Pekny we also demonstrate that our implementation is even without fine-tuning very competitive. Our code is significantly faster, with improvement factors ranging between 15 and 466 on TSPLIB instances.
Who reads Implementing Weighted B-matching Algorithms: Towards a Flexible Software Design?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- M. Müller-Hannemann; A. Schwartz
- Publisher
- ACM
- Published
- 1999
- Language
- EN
- Field
- Computer Science (Physical Sciences)