✦ LIBER ✦

The weighted euclidean 1-center problem

✍ Scribed by R. Chandrasekaran

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 204 KB
Volume: 1
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(82)90009-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(nlogn) randomizing algorithm for th

An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem

✍ Nimrod Megiddo; Eitan Zemel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 710 KB

The obnoxious center problem on weighted

The obnoxious center problem on weighted cactus graphs

✍ Blaž Zmazek; Janez Žerovnik 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 264 KB

The obnoxious center problem in a graph G asks for a location on an edge of the graph such that the minimum weighted distance from this point to a vertex of the graph is as large as possible. An algorithm is given which ÿnds the obnoxious center on a weighted cactus graph in O(cn) time, where n is t

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

On the Euclidean assignment problem

✍ Franz Rendl 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 591 KB

The bi-criteria doubly weighted center-m

The bi-criteria doubly weighted center-median path problem on a tree

✍ J. Puerto; A.M. Rodríguez-Chía; A. Tamir; D. Pérez-Brito 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

On the Euclidean two paths problem

✍ Hans Kellerer; Gerhard Woeginger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 559 KB