Published in: LIPIcs, Volume 371, 24th International Symposium on Experimental Algorithms (SEA 2026)
Dildar Ali, Ansh Jasrotia, Abishek Salaria, and Suman Banerjee. Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization. In 24th International Symposium on Experimental Algorithms (SEA 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 371, pp. 3:1-3:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)
@InProceedings{ali_et_al:LIPIcs.SEA.2026.3,
author = {Ali, Dildar and Jasrotia, Ansh and Salaria, Abishek and Banerjee, Suman},
title = {{Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization}},
booktitle = {24th International Symposium on Experimental Algorithms (SEA 2026)},
pages = {3:1--3:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-422-2},
ISSN = {1868-8969},
year = {2026},
volume = {371},
editor = {Aum\"{u}ller, Martin and Finocchi, Irene},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.3},
URN = {urn:nbn:de:0030-drops-260070},
doi = {10.4230/LIPIcs.SEA.2026.3},
annote = {Keywords: Advertisement, Billboard, Social Network, Bi-submodularity, Influence Maximization}
}