Imagen de Portada

Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ali, Dildar, Jasrotia, Ansh, Salaria, Abishek, Banerjee, Suman
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Databases
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Multi-product Influence Maximization in Billboard Advertisement
por: Ali, Dildar, et al.
Publicado: (2025)

Tag-specific Regret Minimization Problem in Outdoor Advertising
por: Ali, Dildar, et al.
Publicado: (2026)

Influential Slot and Tag Selection in Billboard Advertisement
por: Ali, Dildar, et al.
Publicado: (2024)

Group Trip Planning Query Problem with Multimodal Journey
por: Ali, Dildar, et al.
Publicado: (2025)

Approximately Bisubmodular Regret Minimization in Billboard and Social Media Advertising
por: Ali, Dildar, et al.
Publicado: (2025)

Multi-Slot Tag Assignment Problem in Billboard Advertisement
por: Ali, Dildar, et al.
Publicado: (2024)

Improved Approximation Algorithms for Relational Clustering
por: Esmailpour, Aryan, et al.
Publicado: (2024)

Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
por: Ning, Baoling, et al.
Publicado: (2024)

An Effective Tag Assignment Approach for Billboard Advertisement
por: Ali, Dildar, et al.
Publicado: (2024)

Approximating Queries on Probabilistic Graphs
por: Amarilli, Antoine, et al.
Publicado: (2023)

Approximate Butterfly Counting in Sublinear Time
por: Luo, Chi, et al.
Publicado: (2026)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
por: Wang, Kaixin, et al.
Publicado: (2026)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
por: Liang, Anqi, et al.
Publicado: (2024)

Algorithms for Optimizing Acyclic Queries
por: Luo, Zheng, et al.
Publicado: (2025)

Enumeration Algorithms for Conjunctive Queries with Projection
por: Deep, Shaleen, et al.
Publicado: (2021)

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
por: Ertl, Otmar
Publicado: (2024)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
por: Yin, Ziqi, et al.
Publicado: (2026)

Faster Relational Algorithms Using Geometric Data Structures
por: Esmailpour, Aryan, et al.
Publicado: (2026)

UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
por: Ertl, Otmar
Publicado: (2023)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
por: Kurkure, Yash, et al.
Publicado: (2024)

The SpaceSaving$\pm$ Family of Algorithms for Data Streams with Bounded Deletions
por: Zhao, Fuheng, et al.
Publicado: (2023)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
por: Im, Sungjin, et al.
Publicado: (2025)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
por: Iff, Patrick, et al.
Publicado: (2025)

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
por: Bressan, Marco, et al.
Publicado: (2026)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
por: Zhong, Ming, et al.
Publicado: (2023)

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
por: Rui, Xiaobin, et al.
Publicado: (2025)

Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation
por: Shahbazi, Nima, et al.
Publicado: (2026)

Querying in Constant Expected Time with Learned Indexes
por: Croquevielle, Luis, et al.
Publicado: (2024)

Correlation Sketches for Approximate Join-Correlation Queries
por: Santos, Aécio, et al.
Publicado: (2021)

Profit Maximization in Closed Social Networks
por: Sharma, Poonam, et al.
Publicado: (2026)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
por: Wang, Carrie, et al.
Publicado: (2025)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
por: Armbruster, Alexander, et al.
Publicado: (2026)

CAMP: A Cost Adaptive Multi-Queue Eviction Policy for Key-Value Stores
por: Ghandeharizadeh, Shahram, et al.
Publicado: (2024)

Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs
por: De Man, Quinten, et al.
Publicado: (2026)

Parallel Dynamic Spatial Indexes
por: Men, Ziyang, et al.
Publicado: (2026)

Space-efficient B-tree Implementation for Memory-Constrained Flash Embedded Devices
por: Ould-Khessal, Nadir, et al.
Publicado: (2026)

Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration
por: Bringmann, Karl, et al.
Publicado: (2026)

Listing Even Cycles Faster than the Submodular-Width Barrier
por: Nakos, Vasileios, et al.
Publicado: (2026)

The Importance of Parameters in Ranking Functions
por: Standke, Christoph, et al.
Publicado: (2026)

Frequency Moments in Noisy Streaming and Distributed Data under Mismatch Ambiguity
por: Liu, Kaiwen, et al.
Publicado: (2026)