:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Geis, Lukas, Allendorf, Daniel, Bläsius, Thomas, Leonhardt, Alexander, Meyer, Ulrich, Penschuck, Manuel, Tran, Hung
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2410.22717
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Revisiting a Successful Reduction Rule for Dominating Set
por: Geis, Lukas, et al.
Publicado: (2025)

Insights into $(k,ρ)$-shortcutting algorithms
por: Leonhardt, Alexander, et al.
Publicado: (2024)

Shortcutting for Negative-Weight Shortest Path
por: Li, George Z., et al.
Publicado: (2025)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
por: Li, Jason
Publicado: (2025)

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
por: Li, Jason, et al.
Publicado: (2025)

Negative-Weight Single-Source Shortest Paths in Near-linear Time
por: Bernstein, Aaron, et al.
Publicado: (2022)

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
por: Ashvinkumar, Vikrant, et al.
Publicado: (2023)

An $n^{2+o(1)}$ Time Algorithm for Single-Source Negative Weight Shortest Paths
por: Khanna, Sanjeev, et al.
Publicado: (2026)

A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths
por: Fischer, Nick, et al.
Publicado: (2024)

Enhanced Methods for the Weight Constrained Shortest Path Problem
por: Ahmadi, Saman, et al.
Publicado: (2022)

All-Pairs Shortest Paths with Few Weights per Node
por: Abboud, Amir, et al.
Publicado: (2025)

The Discrepancy of Shortest Paths
por: Bodwin, Greg, et al.
Publicado: (2024)

On Constrained and k Shortest Paths
por: Bendahi, Abderrahim, et al.
Publicado: (2024)

Shortest Paths in Multimode Graphs
por: Kirkpatrick, Yael, et al.
Publicado: (2025)

All-Hops Shortest Paths
por: Williams, Virginia Vassilevska, et al.
Publicado: (2024)

Diameter Computation on (Random) Geometric Graphs
por: Bläsius, Thomas, et al.
Publicado: (2026)

Algorithm Engineering of SSSP With Negative Edge Weights
por: Cassis, Alejandro, et al.
Publicado: (2025)

Single-Source Shortest Path Problem in Weighted Disk Graphs
por: An, Shinwoo, et al.
Publicado: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2024)

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
por: Chitnis, Rajesh, et al.
Publicado: (2024)

The Steiner Shortest Path Tree Problem
por: Asher, Omer, et al.
Publicado: (2025)

Verifying Shortest Paths in Linear Time
por: Shokry, Ahmed, et al.
Publicado: (2024)

Hierarchical Multicriteria Shortest Path Search
por: Kurbanov, Temirlan, et al.
Publicado: (2025)

Covering Approximate Shortest Paths with DAGs
por: Assadi, Sepehr, et al.
Publicado: (2025)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
por: Chen, Kuowen, et al.
Publicado: (2025)

From Hop Reduction to Sparsification for Negative Length Shortest Paths
por: Quanrud, Kent, et al.
Publicado: (2025)

Fully Dynamic Shortest Paths in Sparse Digraphs
por: Karczmarz, Adam, et al.
Publicado: (2024)

Hardness of Approximation for Shortest Path with Vector Costs
por: Carlson, Charlie, et al.
Publicado: (2025)

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

On Incremental Approximate Shortest Paths in Directed Graphs
por: Górkiewicz, Adam, et al.
Publicado: (2025)

Breaking the Bellman-Ford Shortest-Path Bound
por: Elmasry, Amr
Publicado: (2024)

On the External Validity of Average-Case Analyses of Graph Algorithms
por: Bläsius, Thomas, et al.
Publicado: (2022)

Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
por: Atalig, Sunny, et al.
Publicado: (2024)

Knapsack: Connectedness, Path, and Shortest-Path
por: Dey, Palash, et al.
Publicado: (2023)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
por: Pilipczuk, Michał, et al.
Publicado: (2025)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
por: Dory, Michal, et al.
Publicado: (2022)

Improved 2-Approximate Shortest Paths for close vertex pairs
por: Gupta, Manoj
Publicado: (2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
por: Ashvinkumar, Vikrant, et al.
Publicado: (2024)

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