𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some combinatorial problems in the plane

✍ Scribed by P. Erdös; G. Purdy

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
287 KB
Volume
25
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some combinatorial problems
Some combinatorial problems
✍ J. Akiyama; K. Hosono; M. Urabe 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 473 KB
On some metric and combinatorial geometr
On some metric and combinatorial geometric problems
✍ P. Erdös 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 515 KB

Let x1, , x, be n distinct points in the plane. Denote by D(x,, ,x,) the minimum number of distinct distances determined by x1, , x,. Put f(n) = min D(x,,

An approximation scheme for some Steiner
An approximation scheme for some Steiner tree problems in the plane
✍ Wang, Lusheng; Jiang, Tao 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 536 KB

We design a polynomial-time approximation scheme for the Steiner tree problem in the plane when the given set of regular points is c-local, i.e., in the minimum-cost spanning tree for the given set of regular points, the length of the longest edge is at most c times the length of the shortest edge.