Pages that link to "Item:Q4210144"
From MaRDI portal
The following pages link to Fast Algorithms for Constructing t-Spanners and Paths with Stretch t (Q4210144):
Displaying 23 items.
- Minimizing Flow-Time on Unrelated Machines (Q2941582) (← links)
- Randomized Rounding for the Largest Simplex Problem (Q2941583) (← links)
- Greedy Algorithms for Steiner Forest (Q2941584) (← links)
- Secretary Problems with Non-Uniform Arrival Order (Q2941585) (← links)
- Online Submodular Welfare Maximization (Q2941586) (← links)
- New Doubling Spanners: Better and Simpler (Q2954370) (← links)
- Improved Approximation for the Directed Spanner Problem (Q3012787) (← links)
- COMPUTING GRAPH SPANNERS IN SMALL MEMORY: FAULT-TOLERANCE AND STREAMING (Q3084692) (← links)
- Multiplicative Approximations of Random Walk Transition Probabilities (Q3088100) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- Transitive-Closure Spanners: A Survey (Q4933368) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- (Q5009588) (← links)
- Bounds on the Spanner-Sum of Torus (Q5069695) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs (Q5297139) (← links)
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs (Q5458845) (← links)
- Computing almost shortest paths (extended abstract) (Q5890493) (← links)
- Rectangles Are Nonnegative Juntas (Q5892101) (← links)
- Exponential Separation of Information and Communication for Boolean Functions (Q5892102) (← links)
- Computing with Tangles (Q5892103) (← links)
- Compact roundtrip routing with topology-independent node names (Q5900132) (← links)
