Pages that link to "Item:Q997827"
From MaRDI portal
The following pages link to Ramsey partitions and proximity data structures (Q997827):
Displaying 19 items.
- Greedy Algorithms for Steiner Forest (Q2941584) (← links)
- Secretary Problems with Non-Uniform Arrival Order (Q2941585) (← links)
- Online Submodular Welfare Maximization (Q2941586) (← links)
- On Approximate Distance Labels and Routing Schemes with Affine Stretch (Q3095345) (← links)
- (Q5009588) (← links)
- (Q5009638) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Near Isometric Terminal Embeddings for Doubling Metrics (Q5115804) (← links)
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
- (Q5743389) (← links)
- Rectangles Are Nonnegative Juntas (Q5892101) (← links)
- Exponential Separation of Information and Communication for Boolean Functions (Q5892102) (← links)
- Computing with Tangles (Q5892103) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
- Reliable Spanners for Metric Spaces (Q6075742) (← links)
- Disjointness graphs of short polygonal chains (Q6144392) (← links)