2026-07-22T12:32:20Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2119 2024-03-06T11:08:34Z ddc:004 open_access

Assessing an approximation algorithm for the minimum fill-in problem in practice Bücker, H. Martin Lülfesmann, Michael Rasch, Arno Sparse linear algebra 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik H. Martin Bücker and Michael Lülfesmann and Arno Rasch 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9061, Combinatorial Scientific Computing (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09061.5 urn:nbn:de:0030-drops-21191 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09061.5 eng https://creativecommons.org/licenses/by/4.0/legalcode