Optimizing budget allocation among channels and influencers-Reference-Cited by-同舟云学术

Optimizing budget allocation among channels and influencers

Published:2012 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 21st international conference on World Wide Web - WWW '12
language:
Short-container-title:

Author:

Alon Noga¹,Gamzu Iftah¹,Tennenholtz Moshe²

Affiliation:

1. Tel Aviv University and Microsoft Research, Tel Aviv, Israel

2. Microsoft Research and Technion, Haifa, Israel

Publisher

ACM Press

Reference31 articles.

1. N. Alon, S. Arora, R. Manokaran, D. Moshkovitz, and O. Weinstein. On the inapproximability of the densest k-subgraph problem. Manuscript, 2011.

2. N. Archak, V. Mirrokni, and M. Muthukrishnan. Budget optimization for online advertising campaigns with carryover effects. In6th Workshop on Ad Auctions, 2010.

3. S. Bharathi, D. Kempe, and M. Salek. Competitive influence maximization in social networks. In Proceedings 3rd International Workshop on Internet and Network Economics, pages 306--311, 2007.

4. A. Bhaskara, M. Charikar, E. Chlamtac, U. Feige, and A. Vijayaraghavan. Detecting high log-densities: an O(n 1/4) approximation for densestk-subgraph. In Proceedings 42nd ACM Symposium on Theory of Computing, pages 201--210, 2010.

5. S. Bhattacharya, G. Goel, S. Gollapudi, and K. Munagala. Budget constrained auctions with heterogeneous items. In Proceedings 42nd ACM Symposium on Theory of Computing, pages 379--388, 2010.

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deletion-Robust Submodular Maximization Under the Cardinality Constraint over the Integer Lattice;Lecture Notes in Computer Science;2024

2. Efficient presolving methods for the influence maximization problem;Networks;2023-07-04

3. Maximizing the Ratio of Monotone DR-Submodular Functions on Integer Lattice;Journal of the Operations Research Society of China;2023-03-27

4. Efficient Streaming Algorithms for Maximizing Monotone DR-Submodular Function on the Integer Lattice;Mathematics;2022-10-13

5. A fast and deterministic algorithm for Knapsack-constrained monotone DR-submodular maximization over an integer lattice;Journal of Global Optimization;2022-06-13