Proof of covering minimality by generalizing the notion of independence (Q5373999): Difference between revisions

@@ Property / cites work @@
+Q2713942
@@ Property / cites work: Q2713942 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056658
@@ Property / cites work: Q3056658 / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete optimization
@@ Property / cites work: Discrete optimization / rank @@
+Normal rank
@@ Property / cites work @@
+On complexity measures of complexes of faces in the unit cube
+Normal rank
@@ Property / cites work @@
+On a minimization problem for a set of Boolean functions
+Normal rank
@@ Property / cites work @@
+An efficient local search heuristic with row weighting for the unicost set covering problem
+Normal rank
@@ Property / cites work @@
+What is the best greedy-like heuristic for the weighted set covering problem?
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1134/s1990478917020053
+Normal rank
@@ Property / OpenAlex ID @@
+W2620049474
@@ Property / OpenAlex ID: W2620049474 / rank @@
+Normal rank