Unconstrained Submodular Maximization with Modular Costs: Tight Approximation and Application to Profit Maximization
Summary: ROI-Greedy yields a polynomial-time guarantee for USM-MC: f(S)−c(S) ≥ f(S*)−c(S*)−ln(c(S*))·c(S*). Tightness holds; extends to profit maximization with sampling, with experiments showing superior efficiency–quality trade-offs vs baselines. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Tianyuan Jin
- 2. Yu Yang
- 3. Renchi Yang
- 4. Jieming Shi
- 5. Keke Huang
- 6. Xiaokui Xiao
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,139 | Host Profit Maximization: Leveraging Performance Incentives and User Flexibility | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 180 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD | 0.00037135181 |
| 2,486 | Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks | 2020 | VLDB | 8.6741469e-05 |
| 4,220 | Revisiting the Stop-and-Stare Algorithms for Influence Maximization | 2017 | VLDB | 6.3493792e-05 |
| 6,179 | Efficient Approximation Algorithms for Adaptive Seed Minimization | 2019 | SIGMOD | 5.1691599e-05 |
Previous
Page 1 / 1
Next