Parallel and serial heuristics for the minimum set cover problem

DOI10.1007/BF00127952zbMath0742.68030MaRDI QIDQ1186830

Sreejit Chakravarty, Ajay Shekhawat

Publication date: 28 June 1992

Published in: The Journal of Supercomputing (Search for Journal in Brave)

zbMATH Keywords

optimization problemsapproximation algorithmsminimum set cover problemparallel heuristics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Discrete mathematics in relation to computer science (68R99)

Cites Work

• Unnamed Item
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Parallel Merge Sort
• A Greedy Heuristic for the Set-Covering Problem

This page was built for publication: Parallel and serial heuristics for the minimum set cover problem