Imagen de Portada

The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lauerbach, Antonio, Reiter, Kendra, Schmidt, Marie
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Solving the Line-Based Dial-a-Ride Problem by Generating Stopping Patterns
por: Lauerbach, Antonio, et al.
Publicado: (2026)

The Line-Based Dial-a-Ride Problem
por: Reiter, Kendra, et al.
Publicado: (2024)

The Parameterized Complexity of Coloring Mixed Graphs
por: Lauerbach, Antonio, et al.
Publicado: (2026)

Modelling Network Resilience: The Complexity of Some Graph Division Games
por: Gutowski, Grzegorz, et al.
Publicado: (2026)

Eliminating Majority Illusions
por: Fioravantes, Foivos, et al.
Publicado: (2025)

The Complexity of Logarithmic Space Bounded Counting Classes
por: Vijayaraghavan, T. C.
Publicado: (2025)

On the Counting Complexity of the Skolem Problem
por: Jindal, Gorav, et al.
Publicado: (2024)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
por: Yamakami, Tomoyuki
Publicado: (2024)

From Alternation to FPRAS: Toward a Complexity Classification of Approximate Counting
por: Hecher, Markus, et al.
Publicado: (2025)

The Line Traveling Salesman and Repairman Problem with Collaboration
por: Golak, Julian, et al.
Publicado: (2025)

Algorithmic Structure in Subset Sum: Deterministic In-Bound Navigation and the Counting Complexity Divide
por: Nkosi, Thami
Publicado: (2025)

Parameterized Complexity of the Star Decomposition Problem
por: Hajebi, Sahab, et al.
Publicado: (2024)

The Complexity of Finding and Counting Subtournaments
por: Döring, Simon, et al.
Publicado: (2025)

On the Complexity of Problems on Tree-structured Graphs
por: Bodlaender, Hans L., et al.
Publicado: (2022)

The Complexity of Drawing Graphs on Few Lines and Few Planes
por: Chaplick, Steven, et al.
Publicado: (2016)

Complexity of the Guarded Two-Variable Fragment with Counting Quantifiers
por: Pratt-Hartmann, Ian
Publicado: (2006)

The Complexity of Counting Small Sub-Hypergraphs
por: Bressan, Marco, et al.
Publicado: (2025)

Complexity Thresholds for the Constrained Colored Token Swapping Problem
por: Bilò, Davide, et al.
Publicado: (2026)

Boolean Circuit Complexity and Two-Dimensional Cover Problems
por: Cavalar, Bruno P., et al.
Publicado: (2025)

The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side
por: Asimi, Kristina, et al.
Publicado: (2024)

Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
por: Jackiewicz, Marcel, et al.
Publicado: (2024)

Multicut Problems in Almost-Planar Graphs: The Dependency of Complexity on the Demand Pattern
por: Hörsch, Florian, et al.
Publicado: (2025)

The Complexity Classes of Hamming Distance Recoverable Robust Problems
por: Grüne, Christoph
Publicado: (2022)

On the Descriptive Complexity of Vertex Deletion Problems
por: Bannach, Max, et al.
Publicado: (2024)

The Descriptive Complexity of Relation Modification Problems
por: Chudigiewitsch, Florian, et al.
Publicado: (2026)

On the Complexity of the Skolem Problem at Low Orders
por: Bacik, Piotr, et al.
Publicado: (2025)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
por: Przybyłek, Michał R., et al.
Publicado: (2026)

The Counting General Dominating Set Framework
por: Zheng, Jiayi, et al.
Publicado: (2026)

Epistemic Logic Programs: Non-Ground and Counting Complexity
por: Eiter, Thomas, et al.
Publicado: (2025)

Complexity Theory for Quantum Promise Problems
por: Chia, Nai-Hui, et al.
Publicado: (2024)

On the Complexity of the Succinct State Local Hamiltonian Problem
por: Waite, Gabriel, et al.
Publicado: (2025)

A Note on the Complexity of the Spectral Gap Problem
por: Yirka, Justin
Publicado: (2025)

Low Sets and Closure Properties of Counting Function Classes
por: Ivanashev, Yaroslav
Publicado: (2025)

Lower Bounds for Subset Sum in Resolution with Modular Counting
por: Part, Fedor
Publicado: (2022)

Hilbert's Nullstellensatz is in the Counting Hierarchy
por: Andrews, Robert, et al.
Publicado: (2026)

Counting Martingales for Measure and Dimension in Complexity Classes
por: Hitchcock, John M., et al.
Publicado: (2025)

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzążewski Conjecture
por: Baril, Ambroise, et al.
Publicado: (2024)

Complexity Classification of Product State Problems for Local Hamiltonians
por: Kallaugher, John, et al.
Publicado: (2024)

Counting Triangulations of Fixed Cardinal Degrees
por: Chambers, Erin, et al.
Publicado: (2025)

Learning DFAs from Positive Examples Only via Word Counting
por: Bordais, Benjamin, et al.
Publicado: (2025)