Image de couverture de livre

Efficient and Practical Approximation Algorithms for Advertising in Content Feeds

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhang, Guangyi, Sarpe, Ilie, Gionis, Aristides
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficient and Adaptive Estimation of Local Triadic Coefficients
par: Sarpe, Ilie, et autres
Publié: (2025)

Scalable Temporal Motif Densest Subnetwork Discovery
par: Sarpe, Ilie, et autres
Publié: (2024)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
par: Zhang, Guangyi, et autres
Publié: (2026)

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
par: Venturin, Giorgio, et autres
Publié: (2025)

Sample and Expand: Discovering Low-rank Submatrices With Quality Guarantees
par: Ciaperoni, Martino, et autres
Publié: (2025)

Diversity-aware clustering: Computational Complexity and Approximation Algorithms
par: Thejaswi, Suhas, et autres
Publié: (2024)

Fair Committee Selection under Ordinal Preferences and Limited Cardinal Information
par: Gadekar, Ameet, et autres
Publié: (2025)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
par: Tu, Sijing, et autres
Publié: (2025)

Label-consistent clustering for evolving data
par: Gadekar, Ameet, et autres
Publié: (2025)

Sequential Diversification with Provable Guarantees
par: Wang, Honglian, et autres
Publié: (2024)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
par: Wang, Honglian, et autres
Publié: (2026)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
par: Großmann, Ernestine, et autres
Publié: (2025)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
par: Andoni, Alexandr, et autres
Publié: (2026)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
par: Gavva, Surya Teja, et autres
Publié: (2025)

Efficient Approximation Algorithms for Fair Influence Maximization under Maximin Constraint
par: Rui, Xiaobin, et autres
Publié: (2025)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

The Impact of Approximation on Algorithmic Progress
par: Li, Jeffery, et autres
Publié: (2026)

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
par: Zhou, Jianqi, et autres
Publié: (2025)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
par: Chen, Lin, et autres
Publié: (2026)

Improved Additive Approximation Algorithms for APSP
par: Jin, Ce, et autres
Publié: (2025)

Approximation Algorithms for Fair Repetitive Scheduling
par: Hermelin, Danny, et autres
Publié: (2025)

Approximation Algorithms for Steiner Connectivity Augmentation
par: Hathcock, Daniel, et autres
Publié: (2023)

Approximation Algorithms for Digraph Width Parameters
par: Kintali, Shiva, et autres
Publié: (2011)

A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
par: Bhangale, Amey, et autres
Publié: (2026)

Hardness and Approximation Algorithms for Balanced Districting Problems
par: Dharangutte, Prathamesh, et autres
Publié: (2025)

Improved Approximation Algorithms for Three-Dimensional Knapsack
par: Jansen, Klaus, et autres
Publié: (2025)

Improved Approximation Algorithm for Maximum Balanced Biclique
par: Manurangsi, Pasin
Publié: (2026)

An Improved Approximation Algorithm for Metric Triangle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

Faster Approximation Algorithms for k-Center via Data Reduction
par: Filtser, Arnold, et autres
Publié: (2025)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

$O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
par: Soma, Tasuku, et autres
Publié: (2025)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
par: Zhao, Jingyang, et autres
Publié: (2025)

Automating the Search for Small Hard Examples to Approximation Algorithms
par: Sharma, Eklavya
Publié: (2025)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
par: Chen, Yong, et autres
Publié: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
par: Armbruster, Alexander, et autres
Publié: (2026)

Faster Algorithms for Schatten-p Low Rank Approximation
par: Kacham, Praneeth, et autres
Publié: (2024)

Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms
par: Mo, Guanlin, et autres
Publié: (2024)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
par: Zhao, Jingyang, et autres
Publié: (2023)

Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
par: Dong, Yinhao, et autres
Publié: (2024)