DagSemProc.09061.5.pdf
- Filesize: 82 kB
- 1 pages
Document
Assessing an approximation algorithm for the minimum fill-in problem in practice
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9061
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2009-07-30
Cite AsGet BibTex
H. Martin Bücker, Michael Lülfesmann, and Arno Rasch. Assessing an approximation algorithm for the minimum fill-in problem in practice. In Combinatorial Scientific Computing. Dagstuhl Seminar Proceedings, Volume 9061, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09061.5
https://doi.org/10.4230/DagSemProc.09061.5
Abstract
We investigate an implementation of an approximation algorithm for the minimum fill-in problem. The algorithm has some degree of freedom since it is composed of several subtasks for which one can choose between different algorithms. The goal of the present work is to study the impact of theses components and carefully examine the practicability of the overall approximation algorithm by a set of numerical examples.
Keywords
- Sparse linear algebra
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads