Share Email Print

Proceedings Paper

An Extension Matrix Approach To The General Covering Problem
Author(s): Jiarong Hong; Ryszard Michalski; Carl Uhrik
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A new approach, called the extension matrix (EM) approach, for describing and solving the general covering problem (GCP) is proposed. The paper emphasizes that the GCP is NP-hard and describes an approximately optimal covering algorithm, AE1. AE1 incorporates the EM approach with a variety of heuristic search strategies. Results show the new algorithm to be efficient and useful for large scale problems.

Paper Details

Date Published: 26 March 1986
PDF: 9 pages
Proc. SPIE 0635, Applications of Artificial Intelligence III, (26 March 1986); doi: 10.1117/12.964180
Show Author Affiliations
Jiarong Hong, University of Illinois (United States)
Ryszard Michalski, University of Illinois (United States)
Carl Uhrik, University of Illinois (United States)

Published in SPIE Proceedings Vol. 0635:
Applications of Artificial Intelligence III
John F. Gilmore, Editor(s)

© SPIE. Terms of Use
Back to Top