Cover Image

Reserve Matching with Thresholds

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Evren, Suat
Format:	Preprint
Published:	2023
Subjects:	Theoretical Economics Data Structures and Algorithms F.2; G.2.1; J.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
by: Gillman, David, et al.
Published: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
by: Bläsius, Thomas, et al.
Published: (2024)

Restless reachability problems in temporal graphs
by: Thejaswi, Suhas, et al.
Published: (2020)

Unsplittable Multicommodity Flows in Outerplanar Graphs
by: Alemán-Espinosa, David, et al.
Published: (2025)

Superiority of Instantaneous Decisions in Thin Dynamic Matching Markets
by: Bäumler, Johannes, et al.
Published: (2022)

Computing and Bounding Equilibrium Concentrations in Athermic Chemical Systems
by: Akef, Hamidreza, et al.
Published: (2025)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
by: Bhattacharjee, Rajarshi, et al.
Published: (2024)

Matrix-by-matrix multiplication algorithm with $O(N^2log_2N)$ computational complexity for variable precision arithmetic
by: Paszyński, Maciej
Published: (2024)

Selective algorithm processing of subset sum distributions
by: Dawes, Nick
Published: (2024)

Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
by: Andersson, Joel, et al.
Published: (2026)

An O(nlogn) approximate knapsack algorithm
by: Dawes, Nick
Published: (2025)

Beating Meet-in-the-Middle for Subset Balancing Problems
by: Randolph, Tim, et al.
Published: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
by: Randolph, Tim, et al.
Published: (2024)

Generating Signed Permutations by Twisting Two-Sided Ribbons
by: Yuan, et al.
Published: (2023)

Efficient Uniform Sampling of Surjections via their Profiles
by: Carayol, Arnaud, et al.
Published: (2026)

Smoothed Analysis of Interior-Point Algorithms: Condition Number
by: Dunagan, John, et al.
Published: (2003)

Solving Sparse, Symmetric, Diagonally-Dominant Linear Systems in Time $O (m^{1.31})$
by: Spielman, Daniel A., et al.
Published: (2003)

Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
by: Spielman, Daniel A., et al.
Published: (2006)

Eliminating Illusion in Directed Networks
by: Jana, Sougata, et al.
Published: (2026)

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
by: Li, Yifei
Published: (2024)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
by: Salas, Jesus
Published: (2025)

Min-CSPs on Complete Instances
by: Anand, Aditya, et al.
Published: (2024)

Rabin Games and Colourful Universal Trees
by: Majumdar, Rupak, et al.
Published: (2024)

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
by: Mukhopadhyay, Asish, et al.
Published: (2024)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
by: Hochbaum, Dorit S.
Published: (2016)

Entrywise Approximate Solutions for SDDM Systems in Almost-Linear Time
by: Farfan, Angelo, et al.
Published: (2025)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
by: Bushnell, Brian
Published: (2026)

Constant-Factor Distortion Mechanisms for $k$-Committee Election
by: Pulyassary, Haripriya, et al.
Published: (2025)

Weisfeiler-Leman on graphs of small twin-width
by: Heinrich, Irene, et al.
Published: (2026)

Properties of Egalitarian Sequences of Committees: Theory and Experiments
by: Böhm, Paula, et al.
Published: (2025)

Pop Stacks with a Bypass
by: Cioni, Lapo, et al.
Published: (2024)

A Heuristic for Direct Product Graph Decomposition
by: Calderoni, Luca, et al.
Published: (2021)

Reducing the Space Used by the Sieve of Eratosthenes When Factoring
by: Hartman, Samuel, et al.
Published: (2024)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
by: Li, Shisheng
Published: (2026)

U-index: A Universal Indexing Framework for Matching Long Patterns
by: Ayad, Lorraine A. K., et al.
Published: (2025)

Approximation Algorithms for Action-Reward Query-Commit Matching
by: Derakhshan, Mahsa, et al.
Published: (2026)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
by: Adamson, Duncan, et al.
Published: (2023)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
by: Shota, Kan, et al.
Published: (2024)