Image de couverture de livre

Online Matching in Geometric Random Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sentenac, Flore, Noiry, Nathan, Lerasle, Matthieu, Ménard, Laurent, Perchet, Vianney
Format:	Preprint
Publié:	2023
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

Online matching on stochastic block model
par: Cherifa, Maria, et autres
Publié: (2025)

Dynamic online matching with budget refills
par: Cherifa, Maria, et autres
Publié: (2024)

Lookback Prophet Inequalities
par: Benomar, Ziyad, et autres
Publié: (2024)

Non-clairvoyant Scheduling with Partial Predictions
par: Benomar, Ziyad, et autres
Publié: (2024)

On Tradeoffs in Learning-Augmented Algorithms
par: Benomar, Ziyad, et autres
Publié: (2025)

Addressing Bias in Online Selection with Limited Budget of Comparisons
par: Benomar, Ziyad, et autres
Publié: (2023)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
par: Benomar, Ziyad, et autres
Publié: (2025)

Diameter Computation on (Random) Geometric Graphs
par: Bläsius, Thomas, et autres
Publié: (2026)

Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching
par: Ma, Will
Publié: (2024)

A uniformity principle for spatial matching
par: Ameen, Taha, et autres
Publié: (2026)

Improved Algorithms for Contextual Dynamic Pricing
par: Tullii, Matilde, et autres
Publié: (2024)

Prophet Inequalities: Competing with the Top $\ell$ Items is Easy
par: Molina, Mathieu, et autres
Publié: (2024)

Edge Arrival Online Matching: The Power of Free Disposal on Acyclic Graphs
par: Jiang, Tianle, et autres
Publié: (2024)

Online Matching: A Brief Survey
par: Huang, Zhiyi, et autres
Publié: (2024)

On the Advice Complexity of Online Matching on the Line
par: Csaba, Béla, et autres
Publié: (2024)

Almost Tight Bounds for Online Hypergraph Matching
par: Tröbst, Thorben, et autres
Publié: (2024)

Online Metric Matching: Beyond the Worst Case
par: Yang, Mingwei, et autres
Publié: (2024)

Online Matching with Delays and Size-based Costs
par: Kawase, Yasushi, et autres
Publié: (2024)

Proportionally Fair Matching via Randomized Rounding
par: Duppala, Sharmila, et autres
Publié: (2024)

Enhanced Graph Pattern Matching
par: Cotumaccio, Nicola
Publié: (2024)

Online Algorithms with Randomly Infused Advice
par: Emek, Yuval, et autres
Publié: (2023)

Online Graph Embedding in Star Graphs
par: Dallot, Julien, et autres
Publié: (2026)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
par: Joseph, et autres
Publié: (2023)

The Power of Greedy for Online Minimum Cost Matching on the Line
par: Balkanski, Eric, et autres
Publié: (2022)

Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
par: Burathep, Kunanon, et autres
Publié: (2025)

Online Stochastic Matching with Unknown Arrival Order: Beating $0.5$ against the Online Optimum
par: Sun, Enze, et autres
Publié: (2025)

Degree-bounded Online Bipartite Matching: OCS vs. Ranking
par: Feng, Yilong, et autres
Publié: (2025)

A New Impossibility Result for Online Bipartite Matching Problems
par: Chierichetti, Flavio, et autres
Publié: (2025)

On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication
par: Liu, Yang P.
Publié: (2024)

Optimizing Inventory Placement for a Downstream Online Matching Problem
par: Epstein, Boris, et autres
Publié: (2024)

Online Disjoint Set Covers: Randomization is not Necessary
par: Bienkowski, Marcin, et autres
Publié: (2024)

Weighted Matching in the Random-Order Streaming and Robust Communication Models
par: Hashemi, Diba, et autres
Publié: (2024)

A Unified Framework for Analysis of Randomized Greedy Matching Algorithms
par: Derakhshan, Mahsa, et autres
Publié: (2026)

Online Firefighting on Cactus Graphs
par: Hugen, Max, et autres
Publié: (2025)

A Note on Rounding Matchings in General Graphs
par: Dudeja, Aditi
Publié: (2024)

Efficient Kernelization Algorithm for Bipartite Graph Matching
par: Wu, Guang, et autres
Publié: (2024)

A Randomized Rounding Approach for DAG Edge Deletion
par: Kalantarzadeh, Sina, et autres
Publié: (2025)

When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
par: Udwani, Rajan
Publié: (2023)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
par: Braverman, Mark, et autres
Publié: (2024)

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
par: Kuo, Tung-Wei
Publié: (2024)