Imagen de Portada

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bentert, Matthias, Kellerhals, Leon, Niedermeier, Rolf
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Modification-Fair Cluster Editing
por: Froese, Vincent, et al.
Publicado: (2021)

Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs
por: Wallisch, Christian, et al.
Publicado: (2025)

Placing Green Bridges Optimally, with a Multivariate Analysis
por: Fluschnik, Till, et al.
Publicado: (2021)

Parameterized Shortest Path Reconfiguration
por: Bousquet, Nicolas, et al.
Publicado: (2024)

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

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

Space Complexity Dichotomies for Subgraph Finding Problems in the Streaming Model
por: Shih, Yu-Sheng, et al.
Publicado: (2026)

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
por: Dey, Palash, et al.
Publicado: (2026)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
por: Bentert, Matthias, et al.
Publicado: (2024)

Finding Diverse Solutions in Combinatorial Problems with a Distributive Lattice Structure
por: de Berg, Mark, et al.
Publicado: (2025)

From Chinese Postman to Salesman and Beyond I: Approximating Shortest Tours $δ$-Covering All Points on All Edges
por: Frei, Fabian, et al.
Publicado: (2024)

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

The Parameterized Landscape of Labeled Graph Contractions
por: Lafond, Manuel, et al.
Publicado: (2025)

Parameterized Restless Temporal Path
por: Cauvi, Justine, et al.
Publicado: (2025)

Complexity of Finding and Enumerating Interconnection Trees
por: Demange, Noé, et al.
Publicado: (2026)

Parameterized Maximum Node-Disjoint Paths
por: Lampis, Michael, et al.
Publicado: (2024)

Unifying the Landscape of Super-Logarithmic Dynamic Cell-Probe Lower Bounds
por: Ko, Young Kun
Publicado: (2025)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
por: Bilò, Davide, et al.
Publicado: (2024)

Finding Maximum Common Contractions Between Phylogenetic Networks
por: Marchand, Bertrand, et al.
Publicado: (2024)

Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
por: Gadekar, Ameet, et al.
Publicado: (2025)

Optimal Parallel Basis Finding in Graphic and Related Matroids
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
por: Antoniadis, Antonios, et al.
Publicado: (2025)

Finding One Local Optimum Is Easy -- but What About Two?
por: Kobayashi, Yasuaki, et al.
Publicado: (2025)

Subset Balancing and Generalized Subset Sum via Lattices
por: Gao, Yiming, et al.
Publicado: (2026)

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
por: Bhaskar, Umang, et al.
Publicado: (2025)

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

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
por: Grüttemeier, Niels, et al.
Publicado: (2025)

Optimal Trickle-Down Theorems for Path Complexes via C-Lorentzian Polynomials with Applications to Sampling and Log-Concave Sequences
por: Leake, Jonathan, et al.
Publicado: (2025)

Parameterized Complexity of Vehicle Routing
por: Döring, Michelle, et al.
Publicado: (2025)

On the Parameterized Complexity of Odd Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2025)

On the Complexity of Signed Roman Domination
por: Reddy, Sangam Balchandar
Publicado: (2025)

On the Space Complexity of Online Convolution
por: Andersson, Joel Daniel, et al.
Publicado: (2025)

Computational Complexity in Property Testing
por: Pinto Jr., Renato Ferreira, et al.
Publicado: (2025)

Parameterized Complexity of Finding Dissimilar Shortest Paths
por: Funayama, Ryo, et al.
Publicado: (2024)

The Fine-Grained Complexity of Episode Matching
por: Bille, Philip, et al.
Publicado: (2021)

On the Parameterized Complexity of Min-Sum-Radii
por: Kumar, Pankaj, et al.
Publicado: (2026)

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

The Complexity of Maximal Common Subsequence Enumeration
por: Buzzega, Giovanni, et al.
Publicado: (2025)

Complexity of Local Search for Euclidean Clustering Problems
por: Manthey, Bodo, et al.
Publicado: (2023)

Novel Complexity Results for Temporal Separators with Deadlines
por: Dondi, Riccardo, et al.
Publicado: (2025)