AE1: An extension matrix approximate method for the general covering problem

DOI10.1007/BF00991183MaRDI QIDQ3746883zbMATH OpenOpenAlexFDO

Authors Jiarong Hong

Publication date 1985

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00991183

zbMATH Keywords

approximately optimal covering algorithmNP-hardset-covering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 597806
• scientific article; zbMATH DE number 709680
• scientific article; zbMATH DE number 2000148
• The multicovering problem
• Computer Solutions to Minimum-Cover Problems

Cited in

(6)

• FCV\(_1\): A new fast greedy covering algorithm
• AECAM: An extension matrix algorithm on a cellular automata machine
• Optimization problems in extension matrices
• Fuzzy feature selection based on min-max learning rule and extension matrix
• scientific article; zbMATH DE number 597806 (Why is no real title available?)
• A new approach to fuzzy rule generation: Fuzzy extension matrix

This page was built for publication: AE1: An extension matrix approximate method for the general covering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3746883)