Parallel and serial heuristics for the minimum set cover problem
by Ajay Shekhawat
Part of Technical report (State University of New York at Buffalo. Dept. of Computer Science) -- 90-07
No club is reading this yet — be the first to start one
Discuss Parallel and serial heuristics for the minimum set cover problem with other readers
Join or start a book club for Parallel and serial heuristics for the minimum set cover problem on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Parallel and serial heuristics for the minimum set cover problem?
Sign up free on Readfeed, then browse public clubs or start your own club with Parallel and serial heuristics for the minimum set cover problem as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Parallel and serial heuristics for the minimum set cover problem with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Parallel and serial heuristics for the minimum set cover problem with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.