:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Xu, Pan
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2503.15399
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Tight Competitive and Variance Analyses of Matching Policies in Gig Platforms
por: Xu, Pan
Publicado: (2024)

Competitive Online Transportation Simplified
por: Arndt, Stephen, et al.
Publicado: (2025)

Competitive Policies for Online Collateral Maintenance
por: Almashaqbeh, Ghada, et al.
Publicado: (2024)

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

Bounding the Optimal Performance of Online Randomized Primal-Dual Methods
por: Xu, Pan
Publicado: (2025)

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

Competitive Analysis of Online Facility Assignment Algorithms on Discrete Grid Graphs: Performance Bounds and Remediation Strategies
por: Alif, Lamya, et al.
Publicado: (2026)

Online Matching: A Brief Survey
por: Huang, Zhiyi, et al.
Publicado: (2024)

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

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

Optimal Competitive Ratio of Two-sided Online Bipartite Matching
por: Tang, Zhihao Gavin
Publicado: (2026)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
por: Kalavas, Andreas, et al.
Publicado: (2025)

A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
por: Kalavas, Andreas, et al.
Publicado: (2025)

A Tight Competitive Ratio for Online Submodular Welfare Maximization
por: Ganz, Amit, et al.
Publicado: (2023)

Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources
por: Goyal, Vineet, et al.
Publicado: (2020)

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

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

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

Online Matching with Delays and Size-based Costs
por: Kawase, Yasushi, et al.
Publicado: (2024)

Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items
por: Bienkowski, Marcin, et al.
Publicado: (2026)

The Competitive Ratio of Threshold Policies for Online Unit-density Knapsack Problems
por: Ma, Will, et al.
Publicado: (2019)

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

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

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

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

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

Enhanced Graph Pattern Matching
por: Cotumaccio, Nicola
Publicado: (2024)

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

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

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

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

Competitive Analysis of Online Path Selection: Impacts of Path Length, Topology, and System-Level Costs
por: Cao, Ying, et al.
Publicado: (2024)

Differentially Private Matchings
por: Dinitz, Michael, et al.
Publicado: (2025)

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

Pattern Matching under Weighted Edit Distance
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2025)

The Harmonic Policy for Online Buffer Sharing is (2 + ln n)-Competitive: A Simple Proof
por: Addanki, Vamsi, et al.
Publicado: (2025)

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

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

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

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