A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
type: Item
instance of: scholarly article
title: A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
zbMATH Open document ID: 0969.68194
DOI: 10.1137/S0097539798336073
author: Assaf Natanzon
author: Ron Shamir
author: Roded Sharan
published in: SIAM Journal on Computing
publication date: 2000-10-18T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 1519287
zbMATH Keywords: approximation algorithms
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: graph algorithms
zbMATH Keywords: minimum fill-in
zbMATH Keywords: chordal graphs
zbMATH Keywords: chain graphs
zbMATH Keywords: chordal completion
zbMATH Keywords: chain completion
MaRDI profile type: Publication
full work available at URL: s0097539798336073
OpenAlex ID: W2030064859
description: scientific article; zbMATH DE number 1519287