Document Open Access Logo

Assessing an approximation algorithm for the minimum fill-in problem in practice

Authors H. Martin Bücker, Michael Lülfesmann, Arno Rasch



PDF
Thumbnail PDF

File

DagSemProc.09061.5.pdf
  • Filesize: 82 kB
  • 1 pages

Document Identifiers

Author Details

H. Martin Bücker
Michael Lülfesmann
Arno Rasch

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

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)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail