Image de couverture de livre

Optimal Rounding for Two-Stage Bipartite Matching

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pollner, Tristan, Saberi, Amin, Wikum, Anders
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

MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
par: Hayderi, Alexandre, et autres
Publié: (2024)

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence
par: AmaniHamedani, Alireza, et autres
Publié: (2024)

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

Approximating Optimum Online for Capacitated Resource Allocation
par: Braun, Alexander, et autres
Publié: (2024)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
par: Bhattacharya, Sayan, et autres
Publié: (2023)

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

Near-Optimal Bayesian Online Assortment of Reusable Resources
par: Feng, Yiding, et autres
Publié: (2025)

Algorithms with Calibrated Machine Learning Predictions
par: Shen, Judy Hanwen, et autres
Publié: (2025)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
par: Jin, Billy, et autres
Publié: (2022)

Optimal Competitive Ratio of Two-sided Online Bipartite Matching
par: Tang, Zhihao Gavin
Publié: (2026)

Interval-Constrained Bipartite Matching over Time
par: Abels, Andreas, et autres
Publié: (2024)

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

On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope
par: Nägele, Martin, et autres
Publié: (2026)

Approximate Bipartite $b$-Matching using Multiplicative Auction
par: Samineni, Bhargav, et autres
Publié: (2024)

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

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

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)

Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching
par: Zheng, Da Wei, et autres
Publié: (2023)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
par: Azarmehr, Amir, et autres
Publié: (2024)

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

Stable Matching with Interviews
par: Ashlagi, Itai, et autres
Publié: (2025)

Sublinear Algorithms for TSP via Path Covers
par: Behnezhad, Soheil, et autres
Publié: (2023)

A Faster Algorithm for Maximum Weight Matching on Unrestricted Bipartite Graphs
par: Kwok, Shawxing
Publié: (2025)

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

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

Bipartite Matching is in Catalytic Logspace
par: Agarwala, Aryan, et autres
Publié: (2025)

A Bicriterion Concentration Inequality and Prophet Inequalities for $k$-Fold Matroid Unions
par: Alon, Noga, et autres
Publié: (2024)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
par: Hathcock, Daniel, et autres
Publié: (2025)

From Unweighted to Weighted Dynamic Matching in Non-Bipartite Graphs: A Low-Loss Reduction
par: Bernstein, Aaron, et autres
Publié: (2025)

Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
par: Chuzhoy, Julia, et autres
Publié: (2024)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
par: Hu, Hang, et autres
Publié: (2022)

Biclique Reconfiguration in Bipartite Graphs
par: Otachi, Yota, et autres
Publié: (2026)

Bipartite Exact Matching in P
par: Du, Yuefeng
Publié: (2026)

Deterministic Online Bipartite Edge Coloring
par: Blikstad, Joakim, et autres
Publié: (2024)

Nearly Optimal Internal Dictionary Matching
par: Chen, Jingbang, et autres
Publié: (2023)

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

Constant-Stretch Rounding on the Hypersimplex
par: Anari, Nima, et autres
Publié: (2026)

Another Hamiltonian Cycle in Bipartite Pfaffian Graphs
par: Björklund, Andreas, et autres
Publié: (2023)

Near-Optimal Property Testers for Pattern Matching
par: Jin, Ce, et autres
Publié: (2025)