baase@MATH.SDSU.EDU (Sara Baase) (07/11/90)
Does anyone have a favorite text to recommend for a beginning graduate course in combinatorial algorithms? I want to cover: Dynamic programming Branch and bound Matching Network flow NP-completeness Heuristic algorithms for a variety of NP-complete problems I've looked at a few obvious possible choices, but haven't yet found a book that includes this selection of topics at the appropriate level. Thanks. Sara Baase baase@cs.sdsu.edu