AE1: An extension matrix approximate method for the general covering problem |
| |
Authors: | Jiarong Hong |
| |
Affiliation: | (1) Department of Computer Science, University of Illinois, Urbana, Illinois |
| |
Abstract: | A new approach, the extension matrix approach, is introduced and used to show that some optimization problems in general covering problem areNP-hard. Approximate solutions for these problems are given. Combining these approximate solutions, this paper presents an approximately optimal covering algorithm,AE1. Implementation shows thatAE1 is efficient and gives optimal or near optimal results.This research was supported in part by the National Science Foundation under Grant DCR 84-06801, Office of Naval Research under Grant N00014-82-K-0186, Defense Advanced Research Project Agency under Grant N00014-K-85-0878, and Education Ministry of the People's Republic of China.On leave from Harbin Institute of Technology, Harbin, China. |
| |
Keywords: | General covering problems set-covering problem extension matrix disjoint extension matrices maximal complex |
本文献已被 SpringerLink 等数据库收录! |
|