๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Profit-based latency problems on the line

โœ Scribed by Sofie Coene; Frits C.R. Spieksma


Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
330 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

โœฆ Synopsis


We consider a latency problem with a profit p i for each client. When serving a client, a revenue of p it is collected. The goal is to find routes for the servers such that total collected revenue is maximized. We study the complexity of different variants of this problem on the line.


๐Ÿ“œ SIMILAR VOLUMES


On the hidden line removal problem
โœ William R. Spillers; Kincho H. Law ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 611 KB
Note: Two rendezvous search problems on
โœ Vic Baston ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 28 KB ๐Ÿ‘ 1 views

A new upper bound is obtained for the two-person symmetric rendezvous value on the real line when the distribution function of their initial distance apart is bounded. A second result shows that if three players are placed randomly on adjacent integers on the real line facing in random directions an

On the no-three-in-line problem
โœ D Craggs; R Hughes-Jones ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 61 KB