Imagen de Portada

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Salas, Jesus
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computational Complexity Discrete Mathematics F.2.2; G.2.1; G.1.6
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
por: Könen, David, et al.
Publicado: (2023)

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

Explicit two-sided unique-neighbor expanders
por: Hsieh, Jun-Ting, et al.
Publicado: (2023)

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

Approximation Algorithms for Correlated Knapsack Orienteering
por: Espinosa, David Aleman, et al.
Publicado: (2024)

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

Better Approximation for Weighted $k$-Matroid Intersection
por: Singer, Neta, et al.
Publicado: (2024)

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

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

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
por: Chen, Yijia, et al.
Publicado: (2023)

Arborescences and Shortest Path Trees when Colors Matter
por: Ardra, P. S., et al.
Publicado: (2024)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
por: Fairbairn, David L., et al.
Publicado: (2024)

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands
por: Shalaby, Ahmed, et al.
Publicado: (2024)

Pop Stacks with a Bypass
por: Cioni, Lapo, et al.
Publicado: (2024)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
por: Nishimura, Yuki, et al.
Publicado: (2025)

Eliminating Illusion in Directed Networks
por: Jana, Sougata, et al.
Publicado: (2026)

Certificate-Sensitive Subset Sum: Realizing Instance Complexity
por: Salas, Jesus
Publicado: (2025)

Color-Constrained Arborescences in Edge-Colored Digraphs
por: Ardra, P. S., et al.
Publicado: (2025)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
por: Streit, Robert P., et al.
Publicado: (2024)

List Coloring of some Cayley graphs using Kernel perfections
por: S, Prajnanaswaroopa
Publicado: (2024)

Alon-Tarsi Number of Some Regular Graphs
por: Prajnanaswaroopa, S.
Publicado: (2023)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
por: Zhong, Xianghui
Publicado: (2018)

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

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

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

A unified worst case for classical simplex and policy iteration pivot rules
por: Disser, Yann, et al.
Publicado: (2023)

The Banach-Butterfly Invariant: Influence-Adaptive Walsh Geometry for Ternary Polynomial Threshold Functions
por: Pavlov, Gorgi
Publicado: (2026)

Two-Sided Lossless Expanders in the Unbalanced Setting
por: Chattopadhyay, Eshan, et al.
Publicado: (2024)

New Results on Edge-coloring and Total-coloring of Split Graphs
por: Couto, Fernanda, et al.
Publicado: (2023)

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

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

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2026)

Searching in trees with $k$-up-modular cost functions
por: Szyfelbein, Michał
Publicado: (2025)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
por: Jacob, Ashwin, et al.
Publicado: (2024)

PosSLP and Sum of Squares
por: Bläser, Markus, et al.
Publicado: (2024)

Breaking the Symmetries of Amenable Graphs
por: Cheng, Christine T.
Publicado: (2025)

Counting overlapping pairs of words
por: Rivals, Eric, et al.
Publicado: (2024)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
por: Zhong, Xianghui
Publicado: (2019)

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