✦ LIBER ✦

On The Span Of A Random Channel Assignment Problem

✍ Scribed by Colin McDiarmid

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 279 KB
Volume: 27
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-007-0051-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the value of a random minimum spannin

On the value of a random minimum spanning tree problem

✍ A.M. Frieze 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 324 KB

A proof of Parisi’s conjecture on the ra

A proof of Parisi’s conjecture on the random assignment problem

✍ Svante Linusson; Johan Wästlund 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 223 KB

On-line algorithms for the channel assig

On-line algorithms for the channel assignment problem in cellular networks

✍ Pilu Crescenzi; Giorgio Gambosi; Paolo Penna 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 364 KB

We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem for temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we chara

On the bottleneck assignment problem

✍ A. Ravindran; V. Ramaswami 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 391 KB

On solving a variation of the assignment

On solving a variation of the assignment problem

✍ Ronald D Armstrong; Zhiying Jin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 280 KB

A variation of the assignment problem

✍ S. Geetha; K.P.K. Nair 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 286 KB