An edge-reduction algorithm for the vertex cover problem
type: Item
instance of: scholarly article
title: An edge-reduction algorithm for the vertex cover problem
zbMATH Open document ID: 1167.90667
author: Qiaoming Han
author: Abraham P. Punnen
author: Yinyu Ye
published in: Operations Research Letters
publication date: 2009-08-14T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5595309
zbMATH Keywords: vertex cover problem
zbMATH Keywords: approximation algorithm
zbMATH Keywords: LP-relaxation
MaRDI profile type: Publication
full work available at URL: j.orl.2009.01.010
OpenAlex ID: W1978372231
cites work: Vertex packings: Structural properties and algorithms
cites work: The importance of being biased
cites work: On the power of unique 2-prover 1-round games
cites work: Automata, Languages and Programming
cites work: Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
cites work: Q4828990
cites work: The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
cites work: Efficient bounds for the stable set, vertex cover and set packing problems
cites work: Vertex Cover Approximations on Random Graphs
cites work: Experimental and Efficient Algorithms
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
DOI: 10.1016/J.ORL.2009.01.010
description: scientific article; zbMATH DE number 5595309