Ranking with submodular functions on a budget (Q2147409): Difference between revisions

@@ Property / cites work @@
+Q5365100
@@ Property / cites work: Q5365100 / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple intents re-ranking
@@ Property / cites work: Multiple intents re-ranking / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Diversified Search Ranking
+Normal rank
@@ Property / cites work @@
+.1162/jmlr.2003.3.4-5.993
@@ Property / cites work: 10.1162/jmlr.2003.3.4-5.993 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Approximating min sum set cover
@@ Property / cites work: Approximating min sum set cover / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941641
@@ Property / cites work: Q2941641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3096108
@@ Property / cites work: Q3096108 / rank @@
+Normal rank
@@ Property / cites work @@
+Best Algorithms for Approximating the Maximum of a Submodular Set Function
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank