{"id":"https://openalex.org/W7164842340","doi":"https://doi.org/10.4230/lipics.sea.2026.3","title":"Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization","display_name":"Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7164842340","doi":"https://doi.org/10.4230/lipics.sea.2026.3"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26007","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.3","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049272744","display_name":"Dildar Ali","orcid":"https://orcid.org/0000-0002-3427-1904"},"institutions":[{"id":"https://openalex.org/I4210127441","display_name":"Indian Institute of Technology Jammu","ror":"https://ror.org/02f0vsw63","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210127441"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ali, Dildar","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Jammu, India"],"raw_orcid":"https://orcid.org/0000-0002-3427-1904","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Jammu, India","institution_ids":["https://openalex.org/I4210127441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138673071","display_name":"Ansh Jasrotia","orcid":"https://orcid.org/0009-0006-2685-4217"},"institutions":[{"id":"https://openalex.org/I8778637","display_name":"National Institute of Technology Srinagar","ror":"https://ror.org/03sfwvw54","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210152752","https://openalex.org/I8778637"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jasrotia, Ansh","raw_affiliation_strings":["Department of Information Technology, National Institute of Technology Srinagar, India"],"raw_orcid":"https://orcid.org/0009-0006-2685-4217","affiliations":[{"raw_affiliation_string":"Department of Information Technology, National Institute of Technology Srinagar, India","institution_ids":["https://openalex.org/I8778637"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5138668382","display_name":"Abishek Salaria","orcid":"https://orcid.org/0009-0002-1676-0971"},"institutions":[{"id":"https://openalex.org/I8778637","display_name":"National Institute of Technology Srinagar","ror":"https://ror.org/03sfwvw54","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210152752","https://openalex.org/I8778637"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Salaria, Abishek","raw_affiliation_strings":["Department of Information Technology, National Institute of Technology Srinagar, India"],"raw_orcid":"https://orcid.org/0009-0002-1676-0971","affiliations":[{"raw_affiliation_string":"Department of Information Technology, National Institute of Technology Srinagar, India","institution_ids":["https://openalex.org/I8778637"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033218913","display_name":"Suman Banerjee","orcid":"https://orcid.org/0000-0003-1761-5944"},"institutions":[{"id":"https://openalex.org/I4210127441","display_name":"Indian Institute of Technology Jammu","ror":"https://ror.org/02f0vsw63","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210127441"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Banerjee, Suman","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Jammu, India"],"raw_orcid":"https://orcid.org/0000-0003-1761-5944","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Jammu, India","institution_ids":["https://openalex.org/I4210127441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.9335194,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.36649999022483826,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.36649999022483826,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.0812000036239624,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.04899999871850014,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6955000162124634},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.650600016117096},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5985999703407288},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5608999729156494},{"id":"https://openalex.org/keywords/budget-constraint","display_name":"Budget constraint","score":0.5548999905586243},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5135999917984009}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6955000162124634},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.650600016117096},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5985999703407288},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5927000045776367},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5608999729156494},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.5548999905586243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5238999724388123},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5135999917984009},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.3603000044822693},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.3190000057220459},{"id":"https://openalex.org/C4727928","wikidata":"https://www.wikidata.org/wiki/Q17164759","display_name":"Social network (sociolinguistics)","level":3,"score":0.3176000118255615},{"id":"https://openalex.org/C518677369","wikidata":"https://www.wikidata.org/wiki/Q202833","display_name":"Social media","level":2,"score":0.29899999499320984},{"id":"https://openalex.org/C98147612","wikidata":"https://www.wikidata.org/wiki/Q215599","display_name":"Promotion (chess)","level":3,"score":0.2694000005722046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.263700008392334},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26007","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.3","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.sea.2026.3","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.sea.2026.3","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26007","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2026.3","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"How":[0],"to":[1,56,111,117,158,165,218],"utilize":[2],"an":[3,16,196],"allocated":[4,55],"budget":[5,53,81,215],"effectively":[6],"for":[7],"branding":[8],"and":[9,31,39,100,139,147,154,168,183,194,208],"promotion":[10],"of":[11,69,108,122,199],"a":[12,52,129,162,171,219],"commercial":[13],"house":[14],"is":[15,62,144,164,173,192],"important":[17],"problem,":[18],"particularly":[19],"when":[20],"multiple":[21,28,84,120],"advertising":[22,73,85],"media":[23,41,121],"are":[24,37,76],"available.":[25],"There":[26],"exist":[27],"such":[29],"media,":[30,74],"among":[32],"them,":[33],"two":[34],"popular":[35],"ones":[36],"billboards":[38],"social":[40],"advertisements.":[42],"In":[43],"this":[44,89,91,125,142],"context,":[45],"the":[46,66,94,106,113,136,180,189,211],"question":[47],"naturally":[48],"arises:":[49],"how":[50,160,169],"should":[51],"be":[54],"maximize":[57],"total":[58,137],"influence?":[59],"Although":[60],"there":[61,75],"significant":[63],"literature":[64],"on":[65],"effective":[67],"use":[68],"budgets":[70],"in":[71,98],"individual":[72],"hardly":[77],"any":[78],"studies":[79],"examining":[80],"allocation":[82],"across":[83],"media.":[86],"To":[87],"bridge":[88],"gap,":[90],"paper":[92],"introduces":[93],"Budget":[95],"Splitting":[96],"Problem":[97],"Billboard":[99],"Social":[101],"Network":[102],"Advertisement.":[103],"We":[104,149,178,201],"introduce":[105,150],"notion":[107],"interaction":[109],"effect":[110],"capture":[112],"additional":[114],"influence":[115,131,138,190,221],"due":[116],"triggers":[118],"from":[119,174],"advertising.":[123],"Using":[124],"notion,":[126],"we":[127],"propose":[128,179],"noble":[130],"function":[132,143,163,172,191],"\u03a6(,)":[133],"that":[134,141,210],"captures":[135],"shows":[140],"non-negative,":[145],"monotone,":[146],"non-bisubmodular.":[148],"bi-submodularity":[151],"ratio":[152],"(\u03b3)":[153],"generalized":[155],"curvature":[156],"(\u03b1)":[157],"measure":[159],"close":[161],"being":[166,175],"bi-submodular":[167],"far":[170],"modular,":[176],"respectively.":[177],"Randomized":[181],"Greedy":[182,186],"Two-Phase":[184],"Adaptive":[185],"approach,":[187],"where":[188],"non-bisubmodular":[193],"achieves":[195],"approximation":[197],"guarantee":[198],"(1/\u03b1)(1-e^(-\u03b3\u03b1)).":[200],"conducted":[202],"several":[203],"experiments":[204],"using":[205],"real-world":[206],"datasets":[207],"observed":[209],"proposed":[212],"solution":[213],"approach\u2019s":[214],"splitting":[216],"leads":[217],"greater":[220],"than":[222],"existing":[223],"approaches.":[224]},"counts_by_year":[],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2026-06-16T00:00:00"}