𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Thek-Centrum Straight-line Location Problem

✍ Scribed by Antonio J. Lozano; Juan A. Mesa; Frank Plastria

Publisher
Springer Netherlands
Year
2009
Tongue
English
Weight
440 KB
Volume
9
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Thek-centrum shortest path problem
Thek-centrum shortest path problem
✍ Robert Garfinkel; Elena FernΓ‘ndez; Timothy J. Lowe πŸ“‚ Article πŸ“… 2006 πŸ› Springer-Verlag 🌐 English βš– 442 KB
TheK-Connection Location Problem in a Pl
TheK-Connection Location Problem in a Plane
✍ Simin Huang; Rajan Batta; Kathrin Klamroth; Rakesh Nagi πŸ“‚ Article πŸ“… 2005 πŸ› Springer US 🌐 English βš– 484 KB
A Greedy On-Line Algorithm for thek-Trac
A Greedy On-Line Algorithm for thek-Track Assignment Problem
✍ U Faigle; W Kern; W.M Nawijn πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 107 KB

Given a collection I I of n jobs that are represented by intervals, we seek a maximal feasible assignment of the jobs to k machines such that not more than Ε½ . c M intervals overlap pairwise on any machine M and that a job is only assigned to a machine if it fits into one of several prescribed time

On a straight-line embedding problem of
On a straight-line embedding problem of graphs
✍ Shin-ichi Tokunaga πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 372 KB

Let G be a planar graph with n vertices, v be a specified vertex of G, and P be a set of n points in the Euclidian plane ~2 in general position. A straight-line embeddin9 of G onto P is an embedding of G onto R 2 whose images of vertices are distinct points in P and whose images of edges are (straig