𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bin packing as a random walk: A note on knödel's paper

✍ Scribed by János Csirik

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
167 KB
Volume
5
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on an open-end bin packing proble
A note on an open-end bin packing problem
✍ Joseph Y.-T. Leung; Moshe Dror; Gilbert H. Young 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 71 KB 👁 1 views

We consider a variant of the classical one-dimensional bin packing problem, which we call the open-end bin packing problem. Suppose that we are given a list L = (p 1 ; p 2 ; : : : ; pn) of n pieces, where p j denotes both the name and the size of the jth piece in L, and an inÿnite collection of inÿn

A note on the last new vertex visited by
A note on the last new vertex visited by a random walk
✍ Lászlo Lovász; Peter Winkler 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## Abstract A “cover tour” of a connected graph __G__ from a vertex __x__ is a random walk that begins at __x__, moves at each step with equal probability to any neighbor of its current vertex, and ends when it has hit every vertex of __G__. The cycle __C__~n~ is well known to have the curious prop