Image de couverture de livre

Potential-Based Greedy Matching for Dynamic Delivery Pooling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ma, Hongyao, Ma, Will, Romero, Matias
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

Greedy Dynamic Matching
par: Arnosti, Nick, et autres
Publié: (2025)

The Power of Greedy for Online Minimum Cost Matching on the Line
par: Balkanski, Eric, et autres
Publié: (2022)

Predict, Reposition, and Allocate: A Greedy and Flow-Based Architecture for Sustainable Urban Food Delivery
par: Makhdomi, Aqsa Ashraf, et autres
Publié: (2025)

A Unified Framework for Analysis of Randomized Greedy Matching Algorithms
par: Derakhshan, Mahsa, et autres
Publié: (2026)

Multiagent Matroid Upgrading: Greedy is Fair and Efficient
par: Ma, Qingwen, et autres
Publié: (2026)

From Dynamic Programs to Greedy Algorithms
par: van Melkebeek, Dieter
Publié: (2025)

Engineering Algorithms for Dynamic Greedy Set Cover
par: Uzrad, Amitai
Publié: (2026)

A Lossless Deamortization for Dynamic Greedy Set Cover
par: Solomon, Shay, et autres
Publié: (2024)

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

New Greedy Spanners and Applications
par: Popova, Elizaveta, et autres
Publié: (2026)

Optimizing Inventory Placement for a Downstream Online Matching Problem
par: Epstein, Boris, et autres
Publié: (2024)

Greedy BST on Permutation Initial Tree
par: Pareek, Akash
Publié: (2024)

Greedy Completion for Weighted $(α,β)$-Spanners
par: Tzalik, Elad
Publié: (2026)

An Improved Greedy Approximation for (Metric) $k$-Means
par: Charikar, Moses, et autres
Publié: (2026)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
par: Chen, Wenjing, et autres
Publié: (2023)

Simple Construction of Greedy Trees and Greedy Permutations
par: Chubet, Oliver, et autres
Publié: (2024)

Matching Composition and Efficient Weight Reduction in Dynamic Matching
par: Bernstein, Aaron, et autres
Publié: (2024)

Maximum Coverage $k$-Antichains and Chains: A Greedy Approach
par: Cáceres, Manuel, et autres
Publié: (2025)

Discrete Effort Distribution via Regret-enabled Greedy Algorithm
par: Cao, Song, et autres
Publié: (2025)

Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
par: Nikolaev, Maksim
Publié: (2024)

Dynamic Rank, Basis, and Matching
par: Brand, Jan van den, et autres
Publié: (2026)

Dynamic Pattern Matching with Wildcards
par: Naeini, Arshia Ataee, et autres
Publié: (2026)

Greedy matroid base packings with applications to dynamic graph density and orientations
par: Arkhipov, Pavel, et autres
Publié: (2025)

A Simple Average-case Analysis of Recursive Randomized Greedy MIS
par: Dalirrooyfard, Mina, et autres
Publié: (2026)

On Bounds for Greedy Schemes in String Optimization based on Greedy Curvatures
par: Li, Bowen, et autres
Publié: (2024)

Expected Cost of Greedy Online Facility Assignment on Regular Polygons (v3)
par: Riad, Md. Rawha Siddiqi, et autres
Publié: (2025)

Improved Local Computation Algorithms for Greedy Set Cover via Retroactive Updates
par: Mitrović, Slobodan, et autres
Publié: (2026)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
par: Bernstein, Aaron, et autres
Publié: (2025)

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
par: Behnezhad, Soheil, et autres
Publié: (2024)

Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs
par: Chaplick, Steven, et autres
Publié: (2024)

On $b$-Matching and Fully-Dynamic Maximum $k$-Edge Coloring
par: El-Hayek, Antoine, et autres
Publié: (2023)

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

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
par: Chuzhoy, Julia, et autres
Publié: (2026)

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

A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals
par: Aouad, Ali, et autres
Publié: (2022)

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
par: Duyster, Anouk, et autres
Publié: (2025)

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
par: Boneh, Itai, et autres
Publié: (2025)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
par: Goranci, Gramoz, et autres
Publié: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
par: Bals, Ben, et autres
Publié: (2025)

Efficient Greedy Discrete Subtrajectory Clustering
par: van der Hoog, Ivor, et autres
Publié: (2025)