Embedding into l ∞ 2 Is Easy, Embedding into l ∞ 3 Is NP-Complete-Reference-Cited by-同舟云学术

Embedding into l ∞ 2 Is Easy, Embedding into l ∞ 3 Is NP-Complete

Published:2008-02-05 Issue:4 Volume:39 Page:747-765
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Edmonds Jeff

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-008-9064-z.pdf

Reference13 articles.

1. Avis, D., Deza, M.: The cut cone, L 1-embedability, complexity and multicommodity flows. Networks 21, 595–617 (1991)

2. Badoiu, M.: Approximation algorithm for embedding metrics into a two-dimensional space. In: SODA’03. Society for Industrial and Applied Mathematics, Philadelphia (2003)

3. Bandelt, H.-J., Chepoi, V.: Embedding metric spaces in the rectilinear plane: a six–point criterion. Discrete Comput. Geom. 15, 107–117 (1996)

4. Bandelt, H.-J., Chepoi, V.: Embedding into the rectilinear grid. Networks 32, 127–132 (1998)

5. Bandelt, H.-J., Chepoi, V., Laurent, M.: Embedding into rectilinear spaces. Discrete Comput. Geom. 19, 595–604 (1998)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An alternative approach to distance geometry using L∞ distances;Discrete Applied Mathematics;2015-12

2. The complexity of LSH feasibility;Theoretical Computer Science;2014-04

3. Embedding into the rectilinear plane in optimal O(n2) time;Theoretical Computer Science;2011-05

4. Optimal Embedding into Star Metrics;Lecture Notes in Computer Science;2009