Image de couverture de livre

A lossless a priori splitting rule for split-delivery routing problems

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jones, Bo, Yu, Julien, Carlsson, John Gunnar
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

A note on the complexity of the picker routing problem in multi-block warehouses and related problems
par: Prunet, Thibault, et autres
Publié: (2023)

An alignment problem
par: McDaniel, Emma L., et autres
Publié: (2024)

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

A constant time complexity algorithm for the unbounded knapsack problem with bounded coefficients
par: Yang, Yang
Publié: (2024)

Constructing self-referential instances for the clique problem
par: Li, Jiaqi, et autres
Publié: (2026)

Resource Leveling: Complexity of a UET two-processor scheduling variant and related problems
par: Bendotti, Pascale, et autres
Publié: (2024)

Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
par: Austrin, Per, et autres
Publié: (2024)

An extension of Dembo-Hammer's reduction algorithm for the 0-1 knapsack problem
par: Yang, Yang
Publié: (2025)

Polynomial kernels for edge modification problems towards block and strictly chordal graphs
par: Dumas, Maël, et autres
Publié: (2022)

Lower bounds on pure dynamic programming for connectivity problems on graphs of bounded path-width
par: Kluk, Kacper, et autres
Publié: (2025)

PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization
par: Scheder, Dominik, et autres
Publié: (2025)

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs
par: Dell, Holger, et autres
Publié: (2022)

On the complexity of global Roman domination problem in graphs
par: Reddy, Sangam Balchandar, et autres
Publié: (2026)

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

The complexity of finding and enumerating optimal subgraphs to represent spatial correlation
par: Enright, Jessica, et autres
Publié: (2020)

Fourier Analysis of Iterative Algorithms
par: Jones, Chris, et autres
Publié: (2024)

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
par: Shih, Yu-Sheng, et autres
Publié: (2026)

On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
par: Li, Tiange, et autres
Publié: (2026)

NP-Hardness and a PTAS for the Pinwheel Problem
par: Kleinberg, Robert, et autres
Publié: (2026)

A Dichotomy Theorem for Multi-Pass Streaming CSPs
par: Fei, Yumou, et autres
Publié: (2025)

A Note on Approximability of Densest At-Least-k-Subgraph
par: Laekhanukit, Bundit, et autres
Publié: (2026)

A Simple Proof that Ricochet Robots is PSPACE-Complete
par: Balanza-Martinez, Jose, et autres
Publié: (2024)

Emit As You Go: Enumerating Edges of a Spanning Tree
par: Casel, Katrin, et autres
Publié: (2025)

Unbounded-width CSPs are Untestable in a Sublinear Number of Queries
par: Fei, Yumou
Publié: (2025)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
par: Clinch, Katie, et autres
Publié: (2025)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
par: Lehner, Lisa, et autres
Publié: (2025)

A Space-space Trade-off for Directed st-Connectivity
par: Edenhofer, Roman
Publié: (2026)

Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
par: de Berg, Mark, et autres
Publié: (2025)

Constant Time with Minimal Preprocessing, a Robust and Extensive Complexity Class
par: Grandjean, Étienne, et autres
Publié: (2025)

Covering a Polyomino-Shaped Stain with Non-Overlapping Identical Stickers
par: Oka, Keigo, et autres
Publié: (2026)

A Subquadratic Two-Party Communication Protocol for Minimum Cost Flow
par: Gholizadeh, Hossein, et autres
Publié: (2025)

A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
par: Buhrman, Harry, et autres
Publié: (2025)

Connectivity-Preserving Important Separators: A Framework for Cut-Uncut Problems
par: Kenig, Batya
Publié: (2025)

A Unified Approach to Memory-Sample Tradeoffs for Detecting Planted Structures
par: Garg, Sumegha, et autres
Publié: (2026)

A tight quasi-polynomial bound for Global Label Min-Cut
par: Jaffke, Lars, et autres
Publié: (2022)

A New Information Complexity Measure for Multi-pass Streaming with Applications
par: Braverman, Mark, et autres
Publié: (2024)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
par: Bai, Tian, et autres
Publié: (2026)

A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
par: Jansen, Klaus, et autres
Publié: (2025)

Conditional lower bounds for sparse parameterized 2-CSP: A streamlined proof
par: S., Karthik C., et autres
Publié: (2023)