On the greedy walk problem

Charles Bordenave; Serguei Foss; Günter Last

doi:10.1007/s11134-011-9246-x

On the greedy walk problem

Charles Bordenave, Serguei Foss, Günter Last

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

This note introduces a greedy walk on Poisson and Binomial processes which is
a close relative to the well known greedy server model. Some open problems are
presented

Original language	English
Pages (from-to)	333-338
Number of pages	6
Journal	Queueing Systems
Volume	68
Issue number	3-4
DOIs	https://doi.org/10.1007/s11134-011-9246-x
Publication status	Published - 1 Aug 2011

Access to Document

10.1007/s11134-011-9246-x

Cite this

@article{79bf2565e096494fa5433ba48a5a89de,

title = "On the greedy walk problem",

abstract = "This note introduces a greedy walk on Poisson and Binomial processes which isa close relative to the well known greedy server model. Some open problems arepresented",

author = "Charles Bordenave and Serguei Foss and G{\"u}nter Last",

year = "2011",

month = aug,

day = "1",

doi = "10.1007/s11134-011-9246-x",

language = "English",

volume = "68",

pages = "333--338",

journal = "Queueing Systems",

issn = "0257-0130",

publisher = "Springer",

number = "3-4",

}

TY - JOUR

T1 - On the greedy walk problem

AU - Bordenave, Charles

AU - Foss, Serguei

AU - Last, Günter

PY - 2011/8/1

Y1 - 2011/8/1

N2 - This note introduces a greedy walk on Poisson and Binomial processes which isa close relative to the well known greedy server model. Some open problems arepresented

AB - This note introduces a greedy walk on Poisson and Binomial processes which isa close relative to the well known greedy server model. Some open problems arepresented

U2 - 10.1007/s11134-011-9246-x

DO - 10.1007/s11134-011-9246-x

M3 - Article

SN - 0257-0130

VL - 68

SP - 333

EP - 338

JO - Queueing Systems

JF - Queueing Systems

IS - 3-4

ER -

On the greedy walk problem

Abstract

Access to Document

Fingerprint

Cite this