Imagen de Portada

On Computing Top-$k$ Simple Shortest Paths from a Single Source

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	D'Emidio, Mattia, Di Stefano, Gabriele
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Artificial Intelligence Information Retrieval Networking and Internet Architecture
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Competitive Analysis of Online Path Selection: Impacts of Path Length, Topology, and System-Level Costs
por: Cao, Ying, et al.
Publicado: (2024)

Toward Self-Adjusting k-ary Search Tree Networks
por: Feder, Evgenii, et al.
Publicado: (2023)

Making Temporal Betweenness Computation Faster and Restless
por: Brunelli, Filippo, et al.
Publicado: (2025)

Tree algorithms for set reconciliation
por: Lázaro, Francisco, et al.
Publicado: (2025)

Quantizing With Randomized Hadamard Transforms: Efficient Heuristic Now Proven
por: Ben-Basat, Ran, et al.
Publicado: (2026)

Greedy Routing in a Sequentially Grown One-Dimensional Random Graph
por: Ponomarenko, Alexander
Publicado: (2026)

An improved Lower Bound for Local Failover in Directed Networks via Binary Covering Arrays
por: Akker, Erik van den, et al.
Publicado: (2026)

An Improved Modular Addition Checksum Algorithm
por: Koopman, Philip
Publicado: (2023)

Revisiting RFID Missing Tag Identification
por: Liu, Kanghuai, et al.
Publicado: (2025)

Deterministic Scheduling of Periodic Messages for Low Latency in Cloud RAN
por: Barth, Dominique, et al.
Publicado: (2018)

Vermilion: A Traffic-Aware Reconfigurable Optical Interconnect with Formal Throughput Guarantees
por: Addanki, Vamsi, et al.
Publicado: (2025)

Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
por: Szyfelbein, Michał, et al.
Publicado: (2026)

PlanB: Efficient Software IPv6 Lookup with Linearized $B^+$-Tree
por: Zhang, Zhihao, et al.
Publicado: (2026)

SQUID: Faster Analytics via Sampled Quantile Estimation
por: Ben-Basat, Ran, et al.
Publicado: (2022)

Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
por: Hanauer, Kathrin, et al.
Publicado: (2023)

Indirect Coflow Scheduling
por: Lindermayr, Alexander, et al.
Publicado: (2025)

Cost-driven prunings for iterative solving of constrained routing problem with SRLG-disjoint protection
por: Mosharev, P. A., et al.
Publicado: (2025)

EdgeSketch: Efficient Analysis of Massive Graph Streams
por: Lemiesz, Jakub, et al.
Publicado: (2026)

Universal Connection Schedules for Reconfigurable Networking
por: Baral, Shaleen, et al.
Publicado: (2025)

FastReChain: A Novel Bidirectional Model-Based Algorithm for Topology Engineering of OCS-Based Clusters
por: Zhu, Zihan, et al.
Publicado: (2025)

In the Search of Optimal Tree Networks: Hardness and Heuristics
por: Buzdalov, Maxim, et al.
Publicado: (2024)

Adaptive determinantal scheduling with fairness in wireless networks
por: Keeler, H. P., et al.
Publicado: (2025)

A Grouped Sorting Queue Supporting Dynamic Updates for Timer Management in High-Speed Network Interface Cards
por: Wang, Zekun, et al.
Publicado: (2026)

Perfect Network Resilience in Polynomial Time
por: Bentert, Matthias, et al.
Publicado: (2026)

Solving No-wait Scheduling for Time-Sensitive Networks with Daisy-Chain Topology
por: Li, Qian, et al.
Publicado: (2026)

SpiderDAN: Matching Augmentation in Demand-Aware Networks
por: Figiel, Aleksander, et al.
Publicado: (2024)

Generic Dijkstra
por: Szcześniak, Ireneusz, et al.
Publicado: (2022)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
por: Xu, Zhenxiang, et al.
Publicado: (2024)

Optimal and Near-Optimal Adaptive Vector Quantization
por: Ben-Basat, Ran, et al.
Publicado: (2024)

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks
por: Ferreira, Miguel, et al.
Publicado: (2025)

The Instability of all Backoff Protocols
por: Goldberg, Leslie Ann, et al.
Publicado: (2026)

Privacy-Preserving Learning-Augmented Data Structures
por: Goyal, Prabhav, et al.
Publicado: (2025)

Assortment Planning with Sponsored Products
por: Tang, Shaojie, et al.
Publicado: (2024)

Algorithm Design for Continual Learning in IoT Networks
por: Hao, Shugang, et al.
Publicado: (2024)

Geometry helps in routing scalability
por: Piekenbrock, Matt
Publicado: (2024)

Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations
por: Sen, Aniruddha, et al.
Publicado: (2023)

Learning-Augmented Online Packet Scheduling with Deadlines
por: Liang, Ya-Chun, et al.
Publicado: (2023)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
por: Pan, Yunjie, et al.
Publicado: (2024)

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
por: Dragan, Feodor F., et al.
Publicado: (2018)

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