Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.90455OpenAlexW2501059503MaRDI QIDQ5475880

Asaf Levin, Refael Hassin

Publication date: 27 June 2006

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

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

zbMATH Keywords

approximation algorithmminimum latencyMinimum sum set cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (3)

A note on the generalized min-sum set cover problem ⋮ Single-machine scheduling with supporting tasks ⋮ Approximation algorithms for the geometric firefighter and budget fence problems

This page was built for publication: Algorithms – ESA 2005