Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Bandwidth packing

From MaRDI portal
Publication:1840503
Jump to:navigation, search

zbMath0967.68167MaRDI QIDQ1840503

Edward G. jun. Coffman, Alexander L. Stolyar

Publication date: 11 February 2001

Published in: Algorithmica (Search for Journal in Brave)


zbMATH Keywords

First Fitpacking algorithmsBest Fit


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)


Related Items (8)

Stability conditions for a discrete-time decentralised medium access algorithm ⋮ A Service System with Packing Constraints: Greedy Randomized Algorithm Achieving Sublinear in Scale Optimality Gap ⋮ Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers ⋮ Interior-Point-Based Online Stochastic Bin Packing ⋮ Study of the maximal throughput of multiclass queueing systems ⋮ Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks ⋮ Bin Packing with Queues ⋮ Instability in stochastic and fluid queueing networks




This page was built for publication: Bandwidth packing

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1840503&oldid=14223202"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 10:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki