ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1603.05614
  4. Cited By
Streaming Algorithms for News and Scientific Literature Recommendation:
  Submodular Maximization with a d-Knapsack Constraint
v1v2v3 (latest)

Streaming Algorithms for News and Scientific Literature Recommendation: Submodular Maximization with a d-Knapsack Constraint

17 March 2016
Qilian Yu
Easton Li Xu
Shuguang Cui
ArXiv (abs)PDFHTML

Papers citing "Streaming Algorithms for News and Scientific Literature Recommendation: Submodular Maximization with a d-Knapsack Constraint"

2 / 2 papers shown
Title
Test Score Algorithms for Budgeted Stochastic Utility Maximization
Test Score Algorithms for Budgeted Stochastic Utility Maximization
Dabeen Lee
Milan Vojnović
Seyoung Yun
112
3
0
30 Dec 2020
Approximability of Monotone Submodular Function Maximization under
  Cardinality and Matroid Constraints in the Streaming Model
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
Chien-Chung Huang
Naonori Kakimura
Simon Mauras
Yuichi Yoshida
68
15
0
13 Feb 2020
1