scientific article
From MaRDI portal
Publication:2921660
zbMath1297.68229MaRDI QIDQ2921660
Harald Räcke, Kedar Dhamdhere, Mihai Bădoiu, R. Ravi, Anastasios Sidiropoulos, Yuri Rabinovich, Anupam Gupta
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (25)
On the Minimum Eccentricity Shortest Path Problem ⋮ Characterizing graphs with convex and connected Cayley configuration spaces ⋮ \(\ell ^2_2\) spreading metrics for vertex ordering problems ⋮ On the minimum eccentricity shortest path problem ⋮ Bandwidth and distortion revisited ⋮ Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs ⋮ Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs ⋮ Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances ⋮ Unnamed Item ⋮ Optimal distortion embedding of complete binary trees into lines ⋮ The complexity of LSH feasibility ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Combinatorial theorems about embedding trees on the real line ⋮ Line-distortion, bandwidth and path-length of a graph ⋮ An exact algorithm for minimum distortion embedding ⋮ Slightly Superexponential Parameterized Problems ⋮ Distortion lower bounds for line embeddings ⋮ Hardness and approximation of minimum distortion embeddings ⋮ Inapproximability for metric embeddings into $\mathbb{R}^{d}$ ⋮ A linear-space algorithm for distance preserving graph embedding ⋮ Unnamed Item ⋮ Retracting Graphs to Cycles ⋮ Unnamed Item ⋮ Decomposing a graph into shortest paths with bounded eccentricity
This page was built for publication:
