A Polynomial Approximation Algorithm for the Minimum Fill-In Problem

In the minimum fill-in problem, one wishes to find a set of edges of smallest size, whose addition to a given graph will make it chordal. The problem has important applications in numerical algebra and has been studied intensively since the 1970s. We give the first polynomial approximation algorithm...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on computing 2000, Vol.30 (4), p.1067-1079
Hauptverfasser:	Natanzon, Assaf, Shamir, Ron, Sharan, Roded
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Decomposition Graphs Guarantees Ratios
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!