home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #26 / NN_1992_26.iso / spool / comp / theory / 2394 < prev    next >
Encoding:
Text File  |  1992-11-11  |  596 b   |  17 lines
  1. Newsgroups: comp.theory
  2. Path: sparky!uunet!think.com!yale.edu!qt.cs.utexas.edu!cs.utexas.edu!tamsun.tamu.edu!cailm
  3. From: cailm@cs.tamu.edu (Liming Cai)
  4. Subject: Approximability of Dominating-Set
  5. Message-ID: <1992Nov11.222943.25025@tamsun.tamu.edu>
  6. Sender: news@tamsun.tamu.edu (Read News)
  7. Organization: Computer Science Department, Texas A&M University
  8. Date: Wed, 11 Nov 1992 22:29:43 GMT
  9. Lines: 6
  10.  
  11. Does Dominating-Set have bounded ratio approximation algorithm?  
  12. I am interested in any recent progress on the approximability 
  13. of Dominating-Set.   Thanks in advance for any pointer.
  14.  
  15. -- LC    
  16.  
  17.