Pricing loss leaders can be hard (Q2637290): Difference between revisions

@@ Property / cites work @@
+Q2921790
@@ Property / cites work: Q2921790 / rank @@
+Normal rank
@@ Property / cites work @@
+Single-minded unlimited supply pricing on sparse instances
+Normal rank
@@ Property / cites work @@
+Q3002785
@@ Property / cites work: Q3002785 / rank @@
+Normal rank
@@ Property / cites work @@
+Combination can be hard
@@ Property / cites work: Combination can be hard / rank @@
+Normal rank
@@ Property / cites work @@
+On Hardness of Pricing Items for Single-Minded Bidders
+Normal rank
@@ Property / cites work @@
+On the power of unique 2-prover 1-round games
@@ Property / cites work: On the power of unique 2-prover 1-round games / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank