Pages that link to "Item:Q4989920"

The following pages link to Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920):

Displaying 9 items.

• Fast approximate shortest paths in the congested clique (Q2064057) (← links)
• Approximate minimum directed spanning trees under congestion (Q2117742) (← links)
• Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
• A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
• Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
• Minimum cost flow in the CONGEST model (Q6148076) (← links)
• Online Spanners in Metric Spaces (Q6195959) (← links)
• Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model (Q6202225) (← links)
• Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique (Q6202226) (← links)