scientific article
From MaRDI portal
Publication:2768266
zbMath0987.05086MaRDI QIDQ2768266
Yuval Rabani, Gruia Călinescu, Howard J. Karloff
Publication date: 30 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (17)
Absolute Lipschitz extendability ⋮ Diffusive estimates for random walks on stationary random graphs of polynomial growth ⋮ Metric extension operators, vertex sparsifiers and Lipschitz extendability ⋮ Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ⋮ Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem ⋮ Relations between scaling exponents in unimodular random graphs ⋮ Euclidean distortion and the sparsest cut ⋮ Graph Clustering using Effective Resistance ⋮ Minimum Violation Vertex Maps and Their Applications to Cut Problems ⋮ Advances in metric embedding theory ⋮ Extending Lipschitz functions via random metric partitions ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ A simple algorithm for the multiway cut problem ⋮ A node-capacitated Okamura-Seymour theorem ⋮ Local embeddings of metric spaces ⋮ Volume distortion for subsets of Euclidean spaces ⋮ Cutting Corners Cheaply, or How to Remove Steiner Points
This page was built for publication:
