The following pages link to Bypassing the embedding (Q3580975):
Displaying 11 items.
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Making doubling metrics geodesic (Q627522) (← links)
- Geometric spanners for weighted point sets (Q634687) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
- Using the doubling dimension to analyze the generalization of learning algorithms (Q923877) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Metric decompositions of path-separable graphs (Q1679219) (← links)
- Spanners for geodesic graphs and visibility graphs (Q1709579) (← links)
- Load balanced distributed directories (Q2139097) (← links)
- Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
