Cover Image

Approximation Algorithms for Action-Reward Query-Commit Matching

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Derakhshan, Mahsa, Ghasemi, Andisheh, MacRury, Calum
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms F.2.2; G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Bipartite Matching in the Probe-Commit Model
by: Borodin, Allan, et al.
Published: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
by: Ma, Will, et al.
Published: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
by: MacRury, Calum, et al.
Published: (2022)

Forward-backward Contention Resolution Schemes for Fair Rationing
by: Ma, Will, et al.
Published: (2025)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
by: Haeupler, Bernhard, et al.
Published: (2024)

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
by: Balzotti, Lorenzo
Published: (2020)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
by: Bampis, Evripidis, et al.
Published: (2024)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
by: Ibrahimpur, Sharat, et al.
Published: (2025)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
by: Dreier, Jan, et al.
Published: (2026)

Structural Parameterization of Steiner Tree Packing
by: Hastrich, Niko, et al.
Published: (2025)

Fast and Simple Sorting Using Partial Information
by: Haeupler, Bernhard, et al.
Published: (2024)

JFR: An Efficient Jump Frontier Relaxation Strategy for Bellman-Ford
by: Wang, Xin, et al.
Published: (2025)

Customizable Contraction Hierarchies -- A Survey
by: Bläsius, Thomas, et al.
Published: (2025)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
by: Dereniowski, Dariusz, et al.
Published: (2024)

Maintaining Routing Structures under Deletions via Self-Pruning
by: Haeupler, Bernhard, et al.
Published: (2025)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
by: Haeupler, Bernhard, et al.
Published: (2023)

Faster shortest-path algorithms using the acyclic-connected tree
by: Stefansson, Elis, et al.
Published: (2025)

Graph Threading
by: Demaine, Erik D., et al.
Published: (2023)

Online $b$-Matching with Stochastic Rewards
by: Albers, Susanne, et al.
Published: (2024)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
by: Dvořák, Pavel, et al.
Published: (2017)

A Piecewise Approach for the Analysis of Exact Algorithms
by: Clinch, Katie, et al.
Published: (2024)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
by: Dabrowski, Konrad K., et al.
Published: (2024)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
by: Eiben, Eduard, et al.
Published: (2023)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)

A polynomial-time algorithm for recognizing high-bandwidth graphs
by: Varona, Luis M. B.
Published: (2026)

Deterministic Minimum Steiner Cut in Maximum Flow Time
by: Ding, Matthew, et al.
Published: (2023)

Graph Threading with Turn Costs
by: Demaine, Erik D., et al.
Published: (2024)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)

Realizing temporal graphs from fastest travel times
by: Klobas, Nina, et al.
Published: (2023)

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees
by: Høgemo, Svein
Published: (2024)

Backdoors for Quantified Boolean Formulas
by: Eriksson, Leif, et al.
Published: (2026)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
by: Kumar, Nikhil, et al.
Published: (2025)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
by: Kumar, Nikhil, et al.
Published: (2025)

Efficient Approximation of Fractional Hypertree Width
by: Korchemna, Viktoriia, et al.
Published: (2024)

Approximation Algorithms for Capacitated Vehicle Routing Problems: A Comprehensive Survey
by: Chen, Yongyu
Published: (2023)

Multiplication of 0-1 matrices via clustering
by: Jansson, Jesper, et al.
Published: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
by: Kowaluk, Mirosław, et al.
Published: (2025)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
by: Kowaluk, Miroslaw, et al.
Published: (2025)

Approximately Partitioning Vertices into Short Paths
by: Gong, Mingyang, et al.
Published: (2026)

On Hardness and Approximation of Broadcasting in Structured Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)