Copertina

Online Matching with Delays and Size-based Costs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kawase, Yasushi, Nakayoshi, Tomohiro
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
di: Harada, Tsubasa, et al.
Pubblicazione: (2025)

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

Analyzing the effect of prediction accuracy on the distributionally-robust competitive ratio
di: Yoshinaga, Toru, et al.
Pubblicazione: (2026)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time
di: Kawase, Yasushi, et al.
Pubblicazione: (2025)

The Power of Greedy for Online Minimum Cost Matching on the Line
di: Balkanski, Eric, et al.
Pubblicazione: (2022)

On the Smallest Size of Internal Collage Systems
di: Migita, Soichiro, et al.
Pubblicazione: (2025)

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
di: Kawase, Yasushi, et al.
Pubblicazione: (2023)

A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
di: Dufay, Marc, et al.
Pubblicazione: (2025)

Online TCP Acknowledgment under General Delays
di: Bhore, Sujoy, et al.
Pubblicazione: (2026)

Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
di: Shmoys, David, et al.
Pubblicazione: (2026)

Online Multi-level Aggregation with Delays and Stochastic Arrivals
di: Mari, Mathieu, et al.
Pubblicazione: (2024)

Online Matching: A Brief Survey
di: Huang, Zhiyi, et al.
Pubblicazione: (2024)

On the Advice Complexity of Online Matching on the Line
di: Csaba, Béla, et al.
Pubblicazione: (2024)

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

Online General Knapsack with Reservation Costs
di: Burjons, Elisabet, et al.
Pubblicazione: (2025)

Online Bin Packing with Item Size Estimates
di: Gehnen, Matthias, et al.
Pubblicazione: (2025)

Almost Tight Bounds for Online Hypergraph Matching
di: Tröbst, Thorben, et al.
Pubblicazione: (2024)

Online Metric Matching: Beyond the Worst Case
di: Yang, Mingwei, et al.
Pubblicazione: (2024)

Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching
di: Ma, Will
Pubblicazione: (2024)

Online Dependent Rounding Schemes for Bipartite Matchings, with Applications
di: Joseph, et al.
Pubblicazione: (2023)

Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time
di: Bhattacharya, Sayan, et al.
Pubblicazione: (2023)

Online Stochastic Matching with Unknown Arrival Order: Beating $0.5$ against the Online Optimum
di: Sun, Enze, et al.
Pubblicazione: (2025)

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

Optimizing Inventory Placement for a Downstream Online Matching Problem
di: Epstein, Boris, et al.
Pubblicazione: (2024)

Degree-bounded Online Bipartite Matching: OCS vs. Ranking
di: Feng, Yilong, et al.
Pubblicazione: (2025)

A New Impossibility Result for Online Bipartite Matching Problems
di: Chierichetti, Flavio, et al.
Pubblicazione: (2025)

Online Joint Replenishment Problem with Arbitrary Holding and Backlog Costs
di: Azar, Yossi, et al.
Pubblicazione: (2025)

Sublinear-Time Lower Bounds for Approximating Matching Size using Non-Adaptive Queries
di: Shah, Vihan
Pubblicazione: (2026)

Edge Arrival Online Matching: The Power of Free Disposal on Acyclic Graphs
di: Jiang, Tianle, et al.
Pubblicazione: (2024)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
di: Braverman, Mark, et al.
Pubblicazione: (2024)

When Stochastic Rewards Reduce to Deterministic Rewards in Online Bipartite Matching
di: Udwani, Rajan
Pubblicazione: (2023)

A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
di: Basiak, Mateusz, et al.
Pubblicazione: (2025)

Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)
di: Riad, Md. Rawha Siddiqi, et al.
Pubblicazione: (2025)

Smoothed Analysis of Online Metric Matching with a Single Sample: Beyond Metric Distortion
di: Li, Yingxi, et al.
Pubblicazione: (2025)

Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs
di: Moseley, Benjamin, et al.
Pubblicazione: (2024)

Online Matching under KIID: Enhanced Competitive Analysis through Ordinary Differential Equation Systems
di: Xu, Pan
Pubblicazione: (2025)

Space-efficient SLP encoding for $O(\log N)$-time random access
di: Takasaka, Akito, et al.
Pubblicazione: (2024)

R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies
di: Kimura, Kotaro, et al.
Pubblicazione: (2025)

Faster Edge Coloring by Partition Sieving
di: Akmal, Shyan, et al.
Pubblicazione: (2025)

Almost succinct representation of maximal palindromes
di: Mieno, Takuya, et al.
Pubblicazione: (2025)