Proof of covering minimality by generalizing the notion of independence (Q5373999): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q2713942 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3056658 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Discrete optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On complexity measures of complexes of faces in the unit cube / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a minimization problem for a set of Boolean functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient local search heuristic with row weighting for the unicost set covering problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: What is the best greedy-like heuristic for the weighted set covering problem? / rank | |||
Normal rank | |||
Revision as of 09:59, 15 July 2024
scientific article; zbMATH DE number 6857053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof of covering minimality by generalizing the notion of independence |
scientific article; zbMATH DE number 6857053 |
Statements
Proof of covering minimality by generalizing the notion of independence (English)
0 references
6 April 2018
0 references
set covering problem
0 references
complexity
0 references
shortest cover
0 references
minimal cover
0 references
independent set
0 references
lower bound
0 references
condition of minimality
0 references
0 references
