Path: utzoo!attcan!uunet!decwrl!ucbvax!MATH.SDSU.EDU!baase
From: baase@MATH.SDSU.EDU (Sara Baase)
Newsgroups: comp.theory
Subject: Combinatorial algorithms texts?
Message-ID: <9007021741.AA19763@math.SDSU.EDU>
Date: 11 Jul 90 13:21:26 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Reply-To: Sara Baase <baase%cs.sdsu.edu@VM1.NoDak.EDU>
Lines: 15


   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