Experimental and Efficient Algorithms
From MaRDI portal
Publication:5710054
DOI10.1007/b136461zbMath1121.68354OpenAlexW2485841483MaRDI QIDQ5710054
Eyjólfur Ingi Ásgeirsson, Clifford Stein
Publication date: 30 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136461
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
An edge-reduction algorithm for the vertex cover problem ⋮ A novel parameterised approximation algorithm for \textsc{minimum vertex cover} ⋮ Strong and weak edges of a graph and linkages with the vertex cover problem
This page was built for publication: Experimental and Efficient Algorithms
