Cover Image

Online Matching on $3$-Uniform Hypergraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Borst, Sander, Kashaev, Danish, Koh, Zhuan Khye
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A nearly optimal randomized algorithm for explorable heap selection
by: Borst, Sander, et al.
Published: (2022)

Improved Online Load Balancing in the Two-Norm
by: Borst, Sander, et al.
Published: (2025)

On the Correlation Gap of Matroids
by: Husić, Edin, et al.
Published: (2022)

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
by: Koh, Zhuan Khye, et al.
Published: (2024)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
by: Jin, Billy, et al.
Published: (2022)

Selfish, Local and Online Scheduling via Vector Fitting
by: Kashaev, Danish
Published: (2025)

On computing approximate Lewis weights
by: Apers, Simon, et al.
Published: (2024)

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
by: Koh, Zhuan Khye, et al.
Published: (2021)

Entropy Regularization and Faster Decremental Matching in General Graphs
by: Chen, Jiale, et al.
Published: (2023)

Online Decision Making with Fairness over Time
by: Chen, Rui, et al.
Published: (2022)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
by: Bhimaraju, Akhil, et al.
Published: (2023)

Solving Linear Programs with Fast Online Learning Algorithms
by: Gao, Wenzhi, et al.
Published: (2021)

A Variational-Calculus Approach to Online Algorithm Design and Analysis
by: Xu, Pan
Published: (2025)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
by: Shen, Owen, et al.
Published: (2026)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
by: Zhai, Jianing, et al.
Published: (2019)

Quantum speedups for linear programming via interior point methods
by: Apers, Simon, et al.
Published: (2023)

Online Stochastic Packing with General Correlations
by: Cetin, Sabri, et al.
Published: (2025)

Oracle-based Uniform Sampling from Convex Bodies
by: Dang, Thanh, et al.
Published: (2025)

Beyond the Half-Approximation: Fair and Efficient Online Class Matching
by: Borst, Sander, et al.
Published: (2026)

3.415-Approximation for Coflow Scheduling via Iterated Rounding
by: Rohwedder, Lars, et al.
Published: (2025)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
by: Tarzanagh, Davoud Ataee, et al.
Published: (2022)

Competitive Online Optimization under Inventory Constraints
by: Lin, Qiulin, et al.
Published: (2019)

Diversity-Fair Online Selection
by: Hu, Ming, et al.
Published: (2025)

Online Linear Programming with Replenishment
by: Chen, Yuze, et al.
Published: (2026)

Optimal Decentralized Smoothed Online Convex Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2024)

Infrequent Resolving Algorithm for Online Linear Programming
by: Li, Guokai, et al.
Published: (2024)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
by: Sergeev, Ivan
Published: (2024)

Distributionally Robust Newsvendor on a Metric
by: Foussoul, Ayoub, et al.
Published: (2024)

The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)

A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)

Extracting Dual Solutions via Primal Optimizers
by: Carmon, Yair, et al.
Published: (2024)

On the complexity of the upgrading version of the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

Accelerating Proximal Gradient Descent via Silver Stepsizes
by: Bok, Jinho, et al.
Published: (2024)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
by: Adil, Deeksha, et al.
Published: (2024)

Convex optimization with $p$-norm oracles
by: Adil, Deeksha, et al.
Published: (2024)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
by: Zhang, Qiao, et al.
Published: (2024)

Fully Subexponential Time Approximation Scheme for Product Partition
by: Costandin, Marius
Published: (2024)