Parsimonious Learning-Augmented Online Metric Matching
Fuente:
arXiv
Saved in:
| Main Authors: | Shin, Yongho, Vajanopath, Phanu |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Learning-Augmented Online Bipartite Fractional Matching
by: Choo, Davin, et al.
Published: (2025)
by: Choo, Davin, et al.
Published: (2025)
Learning-Augmented Online Scheduling with Parsimonious Preemption
by: Blue, Mugen, et al.
Published: (2026)
by: Blue, Mugen, et al.
Published: (2026)
Improved Differentially Private Algorithms for Rank Aggregation
by: Hillebrand, Quentin, et al.
Published: (2025)
by: Hillebrand, Quentin, et al.
Published: (2025)
Optimal Learning-Augmented Algorithm for Online Bidding
by: Lee, Changyeol, et al.
Published: (2026)
by: Lee, Changyeol, et al.
Published: (2026)
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
by: Lee, Changyeol, et al.
Published: (2025)
by: Lee, Changyeol, et al.
Published: (2025)
Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
by: Burathep, Kunanon, et al.
Published: (2025)
by: Burathep, Kunanon, et al.
Published: (2025)
Online Rounding for Set Cover under Subset Arrivals
by: Byrka, Jarosław, et al.
Published: (2025)
by: Byrka, Jarosław, et al.
Published: (2025)
The Price of Privacy For Approximating Max-CSP
by: Dharangutte, Prathamesh, et al.
Published: (2026)
by: Dharangutte, Prathamesh, et al.
Published: (2026)
Learning Augmented Graph $k$-Clustering
by: Fan, Chenglin, et al.
Published: (2025)
by: Fan, Chenglin, et al.
Published: (2025)
Transductive and Learning-Augmented Online Regression
by: Raman, Vinod, et al.
Published: (2025)
by: Raman, Vinod, et al.
Published: (2025)
Learning-Augmented Algorithms for $k$-median via Online Learning
by: Hebbar, Anish, et al.
Published: (2026)
by: Hebbar, Anish, et al.
Published: (2026)
Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion
by: Veldt, Nate, et al.
Published: (2026)
by: Veldt, Nate, et al.
Published: (2026)
Online Conversion with Switching Costs: Robust and Learning-Augmented Algorithms
by: Lechowicz, Adam, et al.
Published: (2023)
by: Lechowicz, Adam, et al.
Published: (2023)
Sublinear Time Algorithm for Online Weighted Bipartite Matching
by: Hu, Hang, et al.
Published: (2022)
by: Hu, Hang, et al.
Published: (2022)
Servicing Matched Client Pairs with Facilities
by: Abbasi, Fateme, et al.
Published: (2026)
by: Abbasi, Fateme, et al.
Published: (2026)
MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
by: Hayderi, Alexandre, et al.
Published: (2024)
by: Hayderi, Alexandre, et al.
Published: (2024)
Finite Sample Bounds for Learning with Score Matching
by: Smedira, Devin, et al.
Published: (2026)
by: Smedira, Devin, et al.
Published: (2026)
Robust Learning-Augmented Dictionaries
by: Zeynali, Ali, et al.
Published: (2024)
by: Zeynali, Ali, et al.
Published: (2024)
Learning-Augmented Hierarchical Clustering
by: Braverman, Vladimir, et al.
Published: (2025)
by: Braverman, Vladimir, et al.
Published: (2025)
Learning-Augmented Frequent Directions
by: Aamand, Anders, et al.
Published: (2025)
by: Aamand, Anders, et al.
Published: (2025)
Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning
by: Attias, Idan, et al.
Published: (2025)
by: Attias, Idan, et al.
Published: (2025)
On the Power of Learning-Augmented Search Trees
by: Chen, Jingbang, et al.
Published: (2022)
by: Chen, Jingbang, et al.
Published: (2022)
Learning-Augmented Algorithms with Explicit Predictors
by: Elias, Marek, et al.
Published: (2024)
by: Elias, Marek, et al.
Published: (2024)
Learning-Augmented Search Data Structures
by: Fu, Chunkai, et al.
Published: (2024)
by: Fu, Chunkai, et al.
Published: (2024)
Online Learning in the Random Order Model
by: Bernasconi, Martino, et al.
Published: (2025)
by: Bernasconi, Martino, et al.
Published: (2025)
Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)
by: Esposito, Emmanuel, et al.
Published: (2022)
Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems
by: Bampis, Evripidis, et al.
Published: (2024)
by: Bampis, Evripidis, et al.
Published: (2024)
Approximate Tree Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees
by: Veldt, Nate, et al.
Published: (2025)
by: Veldt, Nate, et al.
Published: (2025)
Towards Optimal Robustness in Learning-Augmented Paging
by: Chen, Peng, et al.
Published: (2026)
by: Chen, Peng, et al.
Published: (2026)
Learning-Augmented Frequency Estimation in Sliding Windows
by: Shahout, Rana, et al.
Published: (2024)
by: Shahout, Rana, et al.
Published: (2024)
Learning-Augmented Streaming Algorithms for Correlation Clustering
by: Dong, Yinhao, et al.
Published: (2025)
by: Dong, Yinhao, et al.
Published: (2025)
Prediction-Specific Design of Learning-Augmented Algorithms
by: Li, Sizhe, et al.
Published: (2025)
by: Li, Sizhe, et al.
Published: (2025)
Learning-Augmented Moment Estimation on Time-Decay Models
by: Nagawanshi, Soham, et al.
Published: (2026)
by: Nagawanshi, Soham, et al.
Published: (2026)
Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms
by: Angelopoulos, Spyros, et al.
Published: (2025)
by: Angelopoulos, Spyros, et al.
Published: (2025)
Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms
by: Angelopoulos, Spyros, et al.
Published: (2024)
by: Angelopoulos, Spyros, et al.
Published: (2024)
Online Learning with Limited Information in the Sliding Window Model
by: Braverman, Vladimir, et al.
Published: (2026)
by: Braverman, Vladimir, et al.
Published: (2026)
Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
by: Grigorescu, Elena, et al.
Published: (2024)
by: Grigorescu, Elena, et al.
Published: (2024)
A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
by: Grigorescu, Elena, et al.
Published: (2024)
by: Grigorescu, Elena, et al.
Published: (2024)
Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
by: John, Philips George, et al.
Published: (2024)
by: John, Philips George, et al.
Published: (2024)
Online Metric Matching: Beyond the Worst Case
by: Yang, Mingwei, et al.
Published: (2024)
by: Yang, Mingwei, et al.
Published: (2024)
Similar Items
-
Learning-Augmented Online Bipartite Fractional Matching
by: Choo, Davin, et al.
Published: (2025) -
Learning-Augmented Online Scheduling with Parsimonious Preemption
by: Blue, Mugen, et al.
Published: (2026) -
Improved Differentially Private Algorithms for Rank Aggregation
by: Hillebrand, Quentin, et al.
Published: (2025) -
Optimal Learning-Augmented Algorithm for Online Bidding
by: Lee, Changyeol, et al.
Published: (2026) -
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
by: Lee, Changyeol, et al.
Published: (2025)