:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Barak, Zohar, Talgam-Cohen, Inbal
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2602.24042
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Algorithm-to-Contract Framework without Demand Queries
por: Doron-Arad, Ilan, et al.
Publicado: (2025)

Improved Approximation Algorithms for Three-Dimensional Knapsack
por: Jansen, Klaus, et al.
Publicado: (2025)

Weakly Approximating Knapsack in Subquadratic Time
por: Chen, Lin, et al.
Publicado: (2025)

Approximately Counting Knapsack Solutions in Subquadratic Time
por: Feng, Weiming, et al.
Publicado: (2024)

$(1-ε)$-Approximation of Knapsack in Nearly Quadratic Time
por: Mao, Xiao
Publicado: (2023)

Sum-Of-Squares To Approximate Knapsack
por: Kothari, Pravesh K., et al.
Publicado: (2025)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
por: Dughmi, Shaddin, et al.
Publicado: (2025)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
por: Chen, Lin, et al.
Publicado: (2026)

Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
por: Buchem, Moritz, et al.
Publicado: (2024)

Adaptivity Gaps for Stochastic Probing with Subadditive Functions
por: Li, Jian, et al.
Publicado: (2025)

Online Unbounded Knapsack
por: Böckenhauer, Hans-Joachim, et al.
Publicado: (2024)

Approximating Asymmetric A Priori TSP beyond the Adaptivity Gap
por: Christalla, Manuel, et al.
Publicado: (2025)

Online Knapsack Problems with Estimates
por: Balabán, Jakub, et al.
Publicado: (2025)

Simple and Faster Algorithms for Knapsack
por: He, Qizheng, et al.
Publicado: (2023)

Average sensitivity of the Knapsack Problem
por: Kumabe, Soh, et al.
Publicado: (2024)

Convolution and Knapsack in Higher Dimensions
por: Grage, Kilian, et al.
Publicado: (2024)

An Improved Greedy Approximation for (Metric) $k$-Means
por: Charikar, Moses, et al.
Publicado: (2026)

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
por: Kar, Debajyoti, et al.
Publicado: (2026)

Online General Knapsack with Reservation Costs
por: Burjons, Elisabet, et al.
Publicado: (2025)

Stochastic Knapsack with Costs: On Adaptivity and Return-on-Investment
por: Barak, Zohar, et al.
Publicado: (2025)

0-1 Knapsack in Nearly Quadratic Time
por: Jin, Ce
Publicado: (2023)

A Nearly Quadratic-Time FPTAS for Knapsack
por: Chen, Lin, et al.
Publicado: (2023)

Knapsack with Small Items in Near-Quadratic Time
por: Bringmann, Karl
Publicado: (2023)

Fine Grained Lower Bounds for Multidimensional Knapsack
por: Doron-Arad, Ilan, et al.
Publicado: (2024)

On the Complexity of Knapsack under Explorable Uncertainty: Hardness and Algorithms
por: Schlöter, Jens
Publicado: (2025)

Fair Submodular Maximization over a Knapsack Constraint
por: Li, Lijun, et al.
Publicado: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
por: Housni, Omar El, et al.
Publicado: (2024)

Stealing From the Dragon's Hoard: Online Unbounded Knapsack With Removal
por: Gehnen, Matthias, et al.
Publicado: (2025)

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
por: Amanatidis, Georgios, et al.
Publicado: (2020)

Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
por: Alipour, Sharareh, et al.
Publicado: (2025)

Removable Online Knapsack and Advice
por: Böckenhauer, Hans-Joachim, et al.
Publicado: (2020)

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

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
por: Hao, Yimin, et al.
Publicado: (2025)

Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
por: Canonne, Clément L., et al.
Publicado: (2025)

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

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding
por: Doron-Arad, Ilan, et al.
Publicado: (2023)

A New Approach for Approximating Directed Rooted Networks
por: Cohen, Sarel, et al.
Publicado: (2024)

Identifying Approximate Minimizers under Stochastic Uncertainty
por: Al-Thani, Hessa, et al.
Publicado: (2025)

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
por: Bringmann, Karl, et al.
Publicado: (2024)

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
por: Pham, Canh V.
Publicado: (2024)