𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The two-median problem on Manhattan meshes

✍ Scribed by Mordecai J. Golin; Yan Zhang

Publisher
John Wiley and Sons
Year
2007
Tongue
English
Weight
174 KB
Volume
49
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Routing Problems on the Mesh of Buses
Routing Problems on the Mesh of Buses
✍ Kazuo Iwama; Eiji Miyano; Yahiko Kambayashi πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 175 KB

The mesh of buses MBUSs is a parallel computation model which consists of n = n processors, n row buses, and n column buses, but no local connections between neighboring processors. An n lower bound for the permutation routing on this model is shown. The proof does not depend on common predetermined

The solution of two-dimensional free-sur
The solution of two-dimensional free-surface problems using automatic mesh generation
✍ Richard C. Peterson; Peter K. Jimack; Mark A. Kelmanson πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 314 KB πŸ‘ 2 views

A new method is described for the iterative solution of two-dimensional free-surface problems, with arbitrary initial geometries, in which the interior of the domain is represented by an unstructured, triangular Eulerian mesh and the free surface is represented directly by the piecewise-quadratic ed

An improved algorithm for the minmax reg
An improved algorithm for the minmax regret median problem on a tree
✍ Igor Averbakh; Oded Berman πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 116 KB πŸ‘ 1 views

## Abstract We consider the 1‐median problem with uncertain weights for nodes. Specifically, for each node, only an interval estimate of its weight is known. It is required to find a β€œminmax regret” location, that is, to minimize the worst‐case loss in the objective function that may occur because