The following pages link to (Q2768266):
Displayed 17 items.
- A node-capacitated Okamura-Seymour theorem (Q747769) (← links)
- Volume distortion for subsets of Euclidean spaces (Q1016538) (← links)
- Extending Lipschitz functions via random metric partitions (Q1770278) (← links)
- Absolute Lipschitz extendability (Q1876864) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Diffusive estimates for random walks on stationary random graphs of polynomial growth (Q2364140) (← links)
- Metric extension operators, vertex sparsifiers and Lipschitz extendability (Q2630142) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Graph Clustering using Effective Resistance (Q4993308) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- Euclidean distortion and the sparsest cut (Q5423920) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Local embeddings of metric spaces (Q5919791) (← links)
- Relations between scaling exponents in unimodular random graphs (Q6139386) (← links)