We show that the embedding of metric spaces into the l 1 -grid ޚ 2 can be characterized in essentially the same fashion as in the case of the l 1 -plane ޒ 2 . In particular, a metric space can be embedded into ޚ 2 iff every subspace with at most 6 points is embeddable. Moreover, if such an emb
✦ LIBER ✦
Embedding into the rectilinear plane in optimal time
✍ Scribed by Nicolas Catusse; Victor Chepoi; Yann Vaxès
- Book ID
- 108281735
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 319 KB
- Volume
- 412
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Embedding into the rectilinear grid
✍
Bandelt, Hans-J�rgen; Chepoi, Victor
📂
Article
📅
1998
🏛
John Wiley and Sons
🌐
English
⚖ 108 KB
Embedding rectilinear graphs in linear t
✍
Frank Hoffmann; Klaus Kriegel
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 393 KB
Embedding metric spaces in the rectiline
✍
H. -J. Bandelt; V. Chepoi
📂
Article
📅
1996
🏛
Springer
🌐
English
⚖ 559 KB
Degree constrained tree embedding into p
✍
Akihisa Tamura; Yoshiko Tamura
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 316 KB
The rooted tree embedding problem into p
✍
Yoshiko Ikebe; Micha A. Perles; Akihisa Tamura; Shinnichi Tokunaga
📂
Article
📅
1994
🏛
Springer
🌐
English
⚖ 547 KB
Thek-Steiner Ratio in the Rectilinear Pl
✍
Al Borchers; Ding-Zhu Du; Biao Gao; Pengjun Wan
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 240 KB
A Steiner minimum tree SMT in the rectilinear plane is the shortest length tree interconnecting a set of points, called the regular points, possibly using Ž . additional vertices. A k-size Steiner minimum tree kSMT is one that can be split into components where all regular points are leaves and all