Image de couverture de livre

Parameterized Complexity of Finding Dissimilar Shortest Paths

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Funayama, Ryo, Kobayashi, Yasuaki, Uno, Takeaki
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
par: Conte, Alessio, et autres
Publié: (2024)

Finding Diverse Strings and Longest Common Subsequences in a Graph
par: Shida, Yuto, et autres
Publié: (2024)

Structural Parameterizations of $k$-Planarity
par: Gima, Tatsuya, et autres
Publié: (2025)

Parameterized Shortest Path Reconfiguration
par: Bousquet, Nicolas, et autres
Publié: (2024)

Structural Parameterizations of Vertex Integrity
par: Gima, Tatsuya, et autres
Publié: (2023)

The Structural Complexity Landscape of Finding Balance-Fair Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Finding Order-Preserving Subgraphs
par: Imamura, Haruya, et autres
Publié: (2025)

The Discrepancy of Shortest Paths
par: Bodwin, Greg, et autres
Publié: (2024)

Finding One Local Optimum Is Easy -- but What About Two?
par: Kobayashi, Yasuaki, et autres
Publié: (2025)

Finding a Shortest $M$-link Path in a Monge Directed Acyclic Graph
par: Wan, Joy Z.
Publié: (2024)

On Constrained and k Shortest Paths
par: Bendahi, Abderrahim, et autres
Publié: (2024)

All-Hops Shortest Paths
par: Williams, Virginia Vassilevska, et autres
Publié: (2024)

Shortest Paths in Multimode Graphs
par: Kirkpatrick, Yael, et autres
Publié: (2025)

Finding a Minimum Spanning Tree with a Small Non-Terminal Set
par: Hanaka, Tesshu, et autres
Publié: (2023)

Verifying Shortest Paths in Linear Time
par: Shokry, Ahmed, et autres
Publié: (2024)

The Steiner Shortest Path Tree Problem
par: Asher, Omer, et autres
Publié: (2025)

Hierarchical Multicriteria Shortest Path Search
par: Kurbanov, Temirlan, et autres
Publié: (2025)

Covering Approximate Shortest Paths with DAGs
par: Assadi, Sepehr, et autres
Publié: (2025)

Shortcutting for Negative-Weight Shortest Path
par: Li, George Z., et autres
Publié: (2025)

Parameterizing Path Partitions
par: Fernau, Henning, et autres
Publié: (2022)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2023)

Fully Dynamic Shortest Paths in Sparse Digraphs
par: Karczmarz, Adam, et autres
Publié: (2024)

Breaking the Bellman-Ford Shortest-Path Bound
par: Elmasry, Amr
Publié: (2024)

Hardness of Approximation for Shortest Path with Vector Costs
par: Carlson, Charlie, et autres
Publié: (2025)

On Incremental Approximate Shortest Paths in Directed Graphs
par: Górkiewicz, Adam, et autres
Publié: (2025)

Fast and Practical Single-Exponential Algorithms for Branchwidth
par: Kaneda, Taiki, et autres
Publié: (2026)

Efficient Constant-Factor Approximate Enumeration of Minimal Subsets for Monotone Properties with Weight Constraints
par: Kobayashi, Yasuaki, et autres
Publié: (2020)

Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
par: Cardinal, Jean, et autres
Publié: (2026)

Parameterized Complexity of Path Set Packing
par: Aravind, N. R., et autres
Publié: (2022)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
par: Li, Jason
Publié: (2025)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
par: Pilipczuk, Michał, et autres
Publié: (2025)

Knapsack: Connectedness, Path, and Shortest-Path
par: Dey, Palash, et autres
Publié: (2023)

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
par: Haeupler, Bernhard, et autres
Publié: (2025)

2-Layer Fan-Planarity in Polynomial Time
par: Kobayashi, Yasuaki, et autres
Publié: (2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
par: Ashvinkumar, Vikrant, et autres
Publié: (2024)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
par: Chitnis, Rajesh, et autres
Publié: (2024)

Uniform Sampling of Negative Edge Weights in Shortest Path Networks
par: Geis, Lukas, et autres
Publié: (2024)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
par: Dory, Michal, et autres
Publié: (2022)

Improved 2-Approximate Shortest Paths for close vertex pairs
par: Gupta, Manoj
Publié: (2025)