Cover Image

Dynamic online matching with budget refills

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cherifa, Maria, Calauzènes, Clément, Perchet, Vianney
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online matching on stochastic block model
by: Cherifa, Maria, et al.
Published: (2025)

Lookback Prophet Inequalities
by: Benomar, Ziyad, et al.
Published: (2024)

Non-clairvoyant Scheduling with Partial Predictions
by: Benomar, Ziyad, et al.
Published: (2024)

On Tradeoffs in Learning-Augmented Algorithms
by: Benomar, Ziyad, et al.
Published: (2025)

Online Matching in Geometric Random Graphs
by: Sentenac, Flore, et al.
Published: (2023)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
by: Benomar, Ziyad, et al.
Published: (2025)

Improved Algorithms for Contextual Dynamic Pricing
by: Tullii, Matilde, et al.
Published: (2024)

Addressing Bias in Online Selection with Limited Budget of Comparisons
by: Benomar, Ziyad, et al.
Published: (2023)

Prophet Inequalities: Competing with the Top $\ell$ Items is Easy
by: Molina, Mathieu, et al.
Published: (2024)

Recoverable robust shortest path problem under interval budgeted uncertainty representations
by: Jackiewicz, Marcel, et al.
Published: (2024)

Suffix sorting via matching statistics
by: Lipták, Zsuzsanna, et al.
Published: (2022)

Graph matching based on similarities in structure and attributes
by: Candelier, Raphaël
Published: (2024)

Online matching games in bipartite expanders and applications
by: Bauwens, Bruno, et al.
Published: (2022)

Counting perfect matchings and Hamiltonian cycles faster
by: Li, Baitian
Published: (2023)

Online matching with delays and stochastic arrival times
by: Mari, Mathieu, et al.
Published: (2022)

Faster two-dimensional pattern matching with $k$ mismatches
by: Ellert, Jonas, et al.
Published: (2024)

Computing maximal palindromes in non-standard matching models
by: Mieno, Takuya, et al.
Published: (2022)

Improved online load balancing with known makespan
by: Böhm, Martin, et al.
Published: (2024)

A customizable inexact subgraph matching algorithm for attributed graphs
by: Benko, Tatyana, et al.
Published: (2025)

A framework for boosting matching approximation: parallel, distributed, and dynamic
by: Mitrović, Slobodan, et al.
Published: (2025)

Waiting is not easy but worth it: the online TSP on the line revisited
by: Chen, Pei-Chuan, et al.
Published: (2019)

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
by: Bodlaender, Hans L., et al.
Published: (2025)

Faster and simpler online/sliding rightmost Lempel-Ziv factorizations
by: Sumiyoshi, Wataru, et al.
Published: (2024)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
by: Borst, Sander, et al.
Published: (2024)

An $O(n^3)$ time algorithm for the maximum-weight limited-capacity many-to-many matching
by: Rajabi-Alni, Fatemeh, et al.
Published: (2014)

With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design
by: Canonne, Clément L., et al.
Published: (2025)

Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
by: Canonne, Clément L., et al.
Published: (2025)

Rapid mixing of the down-up walk on matchings of a fixed size
by: Jain, Vishesh, et al.
Published: (2024)

Triangle-free 2-matchings
by: Paluch, Katarzyna
Published: (2023)

Finding maximum matchings in RDV graphs efficiently
by: Biedl, Therese, et al.
Published: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
by: Kakimura, Naonori, et al.
Published: (2024)

Optimizations and extensions for fair join pattern matching
by: Karras, Ioannis
Published: (2025)

Constant time enumeration of perfect bipartite matchings
by: Fink, Jiří
Published: (2025)

Dynamic Detours
by: Dadush, Daniel, et al.
Published: (2026)

Learning general Gaussian mixtures with efficient score matching
by: Chen, Sitan, et al.
Published: (2024)

Greedy Dynamic Matching
by: Arnosti, Nick, et al.
Published: (2025)

Dynamic Meta-Kernelization
by: Bertram, Christian, et al.
Published: (2025)

Improved exploration of temporal graphs
by: Bastide, Paul, et al.
Published: (2025)

Approximate Graph Propagation Revisited: Dynamic Parameterized Queries, Tighter Bounds and Dynamic Updates
by: Zhao, Zhuowei, et al.
Published: (2025)

Fast online node labeling with graph subsampling
by: Huang, Yushen, et al.
Published: (2025)