Pages that link to "Item:Q4210147"
From MaRDI portal
The following pages link to Near-Linear Time Construction of Sparse Neighborhood Covers (Q4210147):
Displaying 10 items.
- Secretary Problems with Non-Uniform Arrival Order (Q2941585) (← links)
- Online Submodular Welfare Maximization (Q2941586) (← links)
- Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
- Generating sparse 2—spanners (Q5056130) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs (Q5458845) (← 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)