A Generic Program for Minimal Subsets with Applications

DOI10.1007/3-540-45013-0_12zbMATH Open1278.68069OpenAlexW1562768836MaRDI QIDQ3079925FDOQ3079925

Authors: Rudolf Berghammer 

Publication date: 4 March 2011

Published in: Logic Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45013-0_12

Recommendations

• Applications of a Subset-Generating Algorithm to Base Enumeration, Knapsack and Minimal Covering Problems
• scientific article; zbMATH DE number 4021142
• On the minimum consistent subset problem
• On the minimum consistent subset problem
• An algorithm for generating subsets of fixed size with a strong minimal change property
• An algorithm for computing minimal Geršgorin sets.
• An implicit algorithm for computing the minimal Geršgorin set
• Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets
• The minimal hitting set generation problem: algorithms and computation
• Oil minmax programming problems containing n-set functions

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (1)

• Minimals Plus: an improved algorithm for the random generation of linear extensions of partially ordered sets

Uses Software

• RelView
• MONA

This page was built for publication: A Generic Program for Minimal Subsets with Applications

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