ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Fast approximation algorithms for a nonconvex covering problem
Source Journal of Algorithms archive
Volume 8 ,  Issue 5  (September 1987) table of contents
Pages: 305 - 323  
Year of Publication: 1987
ISSN:0196-6774
Authors
Dorit S. Hochbaum  Univ. of California, Berkeley
Wolfgang Maass  Univ. of Illinois at Chicago, Chicago
Publisher
Academic Press, Inc.  Duluth, MN, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 4
Additional Information:

cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: 10.1016/0196-6774(87)90012-5


Collaborative Colleagues:
Dorit S. Hochbaum: colleagues
Wolfgang Maass: colleagues