Equivalent approximation algorithms for node cover
type: Item
instance of: scholarly article
title: Equivalent approximation algorithms for node cover
zbMATH Open document ID: 0595.68058
DOI: 10.1016/0020-0190(86)90068-2
author: Dan Gusfield
author: Leonard Pitt
published in: Information Processing Letters
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05-04
zbMATH DE Number: 3958746
zbMATH Keywords: node covering
zbMATH Keywords: graph algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(86)90068-2
OpenAlex ID: W1982761864
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: Q3221758
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Two-Processor Scheduling with Start-Times and Deadlines
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: Efficient bounds for the stable set, vertex cover and set packing problems
cites work: Approximation algorithms for combinatorial problems
cites work: Vertex packings: Structural properties and algorithms
cites work: Depth-first search and the vertex cover problem
description: scientific article; zbMATH DE number 3958746