A note on the set union knapsack problem (Q2449074): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2013.12.015
@@ Property / DOI: 10.1016/j.dam.2013.12.015 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2013.12.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2021083959
@@ Property / OpenAlex ID: W2021083959 / rank @@
+Normal rank
@@ Property / cites work @@
+The dense \(k\)-subgraph problem
@@ Property / cites work: The dense \(k\)-subgraph problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4314864
@@ Property / cites work: Q4314864 / rank @@
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph expansion and the unique games conjecture
@@ Property / cites work: Graph expansion and the unique games conjecture / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2013.12.015
@@ Property / DOI: 10.1016/J.DAM.2013.12.015 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2449074