Simplified tight analysis of Johnson's algorithm
type: Item
instance of: scholarly article
title: Simplified tight analysis of Johnson's algorithm
zbMATH Open document ID: 1173.68818
author: Lars Engebretsen
published in: Information Processing Letters
publication date: 2009-08-27T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5599157
zbMATH Keywords: algorithms
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2004.08.001
OpenAlex ID: W2024650545
cites work: Tight bound on Johnson's algorithm for maximum satisfiability
cites work: Approximation algorithms for combinatorial problems
cites work: On the Approximation of Maximum Satisfiability
DOI: 10.1016/J.IPL.2004.08.001
description: scientific article; zbMATH DE number 5599157