Imagen de Portada

An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Yang, Yang
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
por: Yang, Yang
Publicado: (2024)

Self-referential instances of the dominating set problem are irreducible
por: Zhou, Guangyan
Publicado: (2026)

Precoloring extension with demands on paths
por: Das, Arun Kumar, et al.
Publicado: (2025)

Simple approximation algorithms for Polyamorous Scheduling
por: Biktairov, Yuriy, et al.
Publicado: (2024)

An alignment problem
por: McDaniel, Emma L., et al.
Publicado: (2024)

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
por: Björklund, Andreas, et al.
Publicado: (2025)

Nine lower bound conjectures on streaming approximation algorithms for CSPs
por: Singer, Noah G.
Publicado: (2025)

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
por: Dell, Holger, et al.
Publicado: (2022)

Additive approximation algorithm for geodesic centers in $δ$-hyperbolic graphs
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

Constructing self-referential instances for the clique problem
por: Li, Jiaqi, et al.
Publicado: (2026)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
por: Austrin, Per, et al.
Publicado: (2024)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
por: Ducoffe, Guillaume
Publicado: (2026)

A lossless a priori splitting rule for split-delivery routing problems
por: Jones, Bo, et al.
Publicado: (2025)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
por: Dumas, Maël, et al.
Publicado: (2022)

Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
por: Kluk, Kacper, et al.
Publicado: (2025)

Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems
por: Bendotti, Pascale, et al.
Publicado: (2024)

PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization
por: Scheder, Dominik, et al.
Publicado: (2025)

On the Complexity of Minimizing Energy Consumption of Partitioning DAG Tasks
por: Liu, Wei, et al.
Publicado: (2024)

Streaming Complexity Separations for Dense and Sparse Graphs
por: Liu, Yang P., et al.
Publicado: (2026)

Fast decision tree learning solves hard coding-theoretic problems
por: Koch, Caleb, et al.
Publicado: (2024)

Halfspaces are hard to test with relative error
por: Chen, Xi, et al.
Publicado: (2025)

Sublinear-query relative-error testing of halfspaces
por: Chen, Xi, et al.
Publicado: (2026)

On the complexity of global Roman domination problem in graphs
por: Reddy, Sangam Balchandar, et al.
Publicado: (2026)

On the uniqueness and computation of commuting extensions
por: Koiran, Pascal
Publicado: (2024)

Hardness and Tractability of T_{h+1}-Free Edge Deletion
por: Gaikwad, Ajinkya, et al.
Publicado: (2026)

Minimizing the Weighted Number of Tardy Jobs is W[1]-hard
por: Heeger, Klaus, et al.
Publicado: (2024)

On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
por: Li, Tiange, et al.
Publicado: (2026)

Clifford testing: algorithms and lower bounds
por: Hinsche, Marcel, et al.
Publicado: (2025)

Fast quantum algorithm for differential equations
por: Bagherimehrab, Mohsen, et al.
Publicado: (2023)

A note on the complexity of the picker routing problem in multi-block warehouses and related problems
por: Prunet, Thibault, et al.
Publicado: (2023)

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
por: Abbas, Amira, et al.
Publicado: (2025)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
por: Apers, Simon, et al.
Publicado: (2021)

The Price of Being Partial: Complexity of Partial Generalized Dominating Set on Bounded-Treewidth Graphs
por: Greilhuber, Jakob, et al.
Publicado: (2025)

The Trichotomy of Regular Property Testing
por: Bathie, Gabriel, et al.
Publicado: (2025)

Downward self-reducibility in the total function polynomial hierarchy
por: Gajulapalli, Karthik, et al.
Publicado: (2025)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
por: Fujie, Yuto, et al.
Publicado: (2025)

Sublinear-Time Approximation for Graph Frequency Vectors in Hyperfinite Graphs
por: Moroie, Gregory
Publicado: (2025)

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
por: Gholizadeh, Hossein, et al.
Publicado: (2025)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

Better Bounds for Semi-Streaming Single-Source Shortest Paths
por: Assadi, Sepehr, et al.
Publicado: (2025)