Cover Image

Online matching on stochastic block model

Fuente: arXiv

Saved in:

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

Similar Items

Dynamic online matching with budget refills
by: Cherifa, Maria, et al.
Published: (2024)

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

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

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

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

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

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

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

Robust recovery for stochastic block models, simplified and generalized
by: Mohanty, Sidhanth, et al.
Published: (2024)

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

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

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

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

Differentially private exact recovery for stochastic block models
by: Nguyen, Dung, et al.
Published: (2024)

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

Sorting multibay block stacking storage systems
by: Pfrommer, Jakob, et al.
Published: (2024)

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

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

Pairwise sequence alignment with block and character edit operations
by: Alıcıoğlu, Ahmet Cemal, et al.
Published: (2023)

Faster two-dimensional pattern matching with $k$ mismatches
by: Ellert, Jonas, 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)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
by: Abrahamsen, Mikkel, et al.
Published: (2024)

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

Online bipartite matching with imperfect advice
by: Choo, Davin, et al.
Published: (2024)

Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization
by: Nikolov, Aleksandar, et al.
Published: (2026)

Generation of weighted trees, block trees and block graphs
by: Ekim, Tınaz, et al.
Published: (2024)

The stochastic block model has the overlap graph property for modularity
by: Bhamidi, Shankar, et al.
Published: (2026)

Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions
by: Pfrommer, Jakob, et al.
Published: (2022)

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

Online matching and market imbalance
by: Barrientos, Benjamin, et al.
Published: (2025)

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

Improved Online Sorting
by: Nirjhor, Jubayer, et al.
Published: (2025)

Online Metric TSP
by: Bertram, Christian
Published: (2025)

Online String Attractors
by: Whittington, Philip
Published: (2024)

Online Unbounded Knapsack
by: Böckenhauer, Hans-Joachim, et al.
Published: (2024)

The Online Submodular Cover Problem
by: Gupta, Anupam, et al.
Published: (2025)

Online Knapsack Problems with Estimates
by: Balabán, Jakub, et al.
Published: (2025)

Online Firefighting on Cactus Graphs
by: Hugen, Max, et al.
Published: (2025)

Online Facility Assignments on Polygons
by: Malik, Sumaiya, et al.
Published: (2025)