Algorithms - ESA 2003

DOI10.1007/B13632zbMath1266.05117OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897254

Asaf Levin, Refael Hassin

Publication date: 3 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13632

zbMATH Keywords

approximation algorithmedge costsminimum cost set of verticesminimum generalized vertex cover problemvertex costs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Introduction to QUBO ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ Linear time algorithms for approximating the facility terminal cover problem

This page was built for publication: Algorithms - ESA 2003