✦ LIBER ✦

Combinatorial algorithms for some 1-facility median problems in the plane

✍ Scribed by H.W. Hamacher; S. Nickel

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 655 KB
Volume: 79
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90363-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A combinatorial algorithm for the 1-medi

A combinatorial algorithm for the 1-median problem in with the Chebyshev norm

✍ Johannes Hatzl; Andreas Karrenbauer 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Some combinatorial problems in the plane

✍ P. Erdös; G. Purdy 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 287 KB

A linear time algorithm for the reverse

A linear time algorithm for the reverse 1-median problem on a cycle

✍ Rainer E. Burkard; Elisabeth Gassner; Johannes Hatzl 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 1 views

Optimal time bounds for some proximity p

Optimal time bounds for some proximity problems in the plane

✍ Alok Aggarwal; Herbert Edelsbrunner; Prahakar Raghavan; Prasoon Tiwari 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 507 KB

A linear time algorithm for the weighted

A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane

✍ Nir Halman 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 128 KB

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.