Iterative improvement of vertex covers

DOI10.1016/0020-0190(95)00058-KzbMath0998.68540MaRDI QIDQ672405

Youssef G. Saab

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Algorithms

Mathematics Subject Classification ID

Combinatorics on words (68R15) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (1)

Extracting pure network submatrices in linear programs using signed graphs.

Cites Work

• Unnamed Item
• Unnamed Item
• Ramsey numbers and an approximation algorithm for the vertex cover problem
• Efficient bounds for the stable set, vertex cover and set packing problems
• Vertex packings: Structural properties and algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Iterative improvement of vertex covers