> Details

Bücker, H. Martin [Author]; Lülfesmann, Michael [Author]; Rasch, Arno [Author] ; H. Martin Bücker and Michael Lülfesmann and Arno Rasch [Contributor]

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

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article; Electronic Conference Proceeding
  • Title: Assessing an approximation algorithm for the minimum fill-in problem in practice
  • Contributor: Bücker, H. Martin [Author]; Lülfesmann, Michael [Author]; Rasch, Arno [Author]
  • Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2009
  • Language: English
  • DOI: https://doi.org/10.4230/DagSemProc.09061.5
  • Keywords: Sparse linear algebra
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: 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.
  • Access State: Open Access