Image de couverture de livre

Are We Still Missing an Item?

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Magen, Roey
Format:	Preprint
Publié:	2024
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

Barter Exchange with Shared Item Valuations
par: Luque, Juan, et autres
Publié: (2024)

Approximations and Hardness of Packing Partially Ordered Items
par: Doron-Arad, Ilan, et autres
Publié: (2024)

Online Bin Packing with Item Size Estimates
par: Gehnen, Matthias, et autres
Publié: (2025)

Knapsack with Small Items in Near-Quadratic Time
par: Bringmann, Karl
Publié: (2023)

Competitive Transaction Admission in PCNs: Online Knapsack with Positive and Negative Items
par: Bienkowski, Marcin, et autres
Publié: (2026)

Binary $k$-Center with Missing Entries: Structure Leads to Tractability
par: Soheil, Farehe, et autres
Publié: (2025)

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items
par: Petrov, Aleksandr V., et autres
Publié: (2024)

An $O(n\log n)$ Algorithm for Single-Item Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices
par: Papadopoulos, Kleitos
Publié: (2025)

Scalable Learning of Item Response Theory Models
par: Frick, Susanne, et autres
Publié: (2024)

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams
par: Jiang, Cheng, et autres
Publié: (2026)

Revisiting RFID Missing Tag Identification
par: Liu, Kanghuai, et autres
Publié: (2025)

Prophet Secretary and Matching: the Significance of the Largest Item
par: Chen, Ziyun, et autres
Publié: (2024)

Truthful Matching with Online Items and Offline Agents
par: Feldman, Michal, et autres
Publié: (2022)

Sample Complexity of Posted Pricing for a Single Item
par: Jin, Billy, et autres
Publié: (2024)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Linear Regression under Missing or Corrupted Coordinates
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
par: Eden, Alon, et autres
Publié: (2024)

Edge-Minimum Walk of Modular Length in Polynomial Time
par: Amarilli, Antoine, et autres
Publié: (2024)

Concurrent Composition for Differentially Private Continual Mechanisms
par: Henzinger, Monika, et autres
Publié: (2024)

Weighted Reservoir Sampling With Replacement from Data Streams
par: Meligrana, Adriano, et autres
Publié: (2024)

A Comprehensive Survey of Data Reduction Rules for the Maximum Weighted Independent Set Problem
par: Großmann, Ernestine, et autres
Publié: (2024)

Single-Source Regular Path Querying in Terms of Linear Algebra
par: Belyanin, Georgiy, et autres
Publié: (2024)

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
par: Nogler, Jakob, et autres
Publié: (2024)

Compressed Game Solving
par: Considine, Jeffrey
Publié: (2024)

Fair Set Cover
par: Dehghankar, Mohsen, et autres
Publié: (2024)

Fair and Efficient Ridesharing: A Dynamic Programming-based Relocation Approach
par: Makhdomi, Aqsa Ashraf, et autres
Publié: (2024)

Correlation Clustering Beyond the Pivot Algorithm
par: Behnezhad, Soheil, et autres
Publié: (2024)

A Lock-free Binary Trie
par: Ko, Jeremy
Publié: (2024)

Grandchildren-weight-balanced binary search trees
par: Jugé, Vincent
Publié: (2024)

Suffixient Arrays: a New Efficient Suffix Array Compression Technique
par: Cenzato, Davide, et autres
Publié: (2024)

New Algorithm for Combinatorial $n$-folds and Applications
par: Jansen, Klaus, et autres
Publié: (2024)

Vizing's Theorem in Near-Linear Time
par: Assadi, Sepehr, et autres
Publié: (2024)

Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time
par: Bernstein, Aaron, et autres
Publié: (2024)

Simpler Optimal Sorting from a Directed Acyclic Graph
par: van der Hoog, Ivor, et autres
Publié: (2024)

Deterministic Dynamic Edge Colouring
par: Christiansen, Aleksander B. G.
Publié: (2024)

Range Longest Increasing Subsequence and its Relatives
par: S., Karthik C., et autres
Publié: (2024)

Directed Token Sliding
par: Banerjee, Niranka, et autres
Publié: (2024)

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
par: Agarwal, Arpit, et autres
Publié: (2024)

Almost Tight Bounds for Online Hypergraph Matching
par: Tröbst, Thorben, et autres
Publié: (2024)

Technical Report: Modeling Average False Positive Rates of Recycling Bloom Filters
par: Dozier, Kahlil, et autres
Publié: (2024)