albinali@phoenix.Princeton.EDU (Sabah Sabah Albinali) (05/14/91)
Can anyone suggest a good book (or even refrences to articles) on the subject of probabalistic algorithms for the matching problem? Thanks. -sabah
cs433dk@ux1.cso.uiuc.edu (Donald Gillies) (05/15/91)
I am looking for any information on heuristics for the set-cover problem (preferably multi-dimensional, but 2-dimensional would be nice). Has anyone analyzed heuristics that produce vertex covers with less than 2*opt edges in 2 dimensions? Are there heuristics that cover using n-dimensional edges with a constant bound on performance? Any help would be appreciated. Don Gillies | University of Illinois at Urbana-Champaign gillies@cs.uiuc.edu | Digital Computer Lab, 1304 W. Springfield, Urbana IL ---------------------+------------------------------------------------------ "WAR! UGH! ... What is it GOOD FOR? ABSOLUTELY NOTHING!" - the song "WAR" by Edwin Starr, circa 1971