A graph approximation heuristic for the vertex cover problem on planar graphs
type: Item
instance of: scholarly article
title: A graph approximation heuristic for the vertex cover problem on planar graphs
zbMATH Open document ID: 0819.90122
DOI: 10.1016/0377-2217(94)90425-1
author: D. L. Meek
author: R. G. Parker
published in: European Journal of Operational Research
publication date: 1994-07-26T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 611319
zbMATH Keywords: vertex cover problem
zbMATH Keywords: planar graphs
zbMATH Keywords: bipartite graphs
zbMATH Keywords: heuristic
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)90425-1
OpenAlex ID: W2036887185
cites work: An Application of Duality to Edge-Deletion Problems
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: On approximation problems related to the independent set and vertex cover problems
cites work: Q3941433
cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
cites work: Q4147995
cites work: Q3933762
cites work: Paths, Trees, and Flowers
cites work: Matching, Euler tours and the Chinese postman
cites work: Q3883524
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Eulerian Walks in Graphs
cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time
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: Q4040299
cites work: Minimum-maximal matching in series-parallel graphs
description: scientific article; zbMATH DE number 611319