Resource allocation under limited sharing

DOI10.1016/0166-218X(90)90111-OzbMath0713.90069MaRDI QIDQ750312

Michael A. Langston, Michael P. Morford

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmapproximation algorithmsresource sharingtight worst-case performance bound

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Ergodicity of one-dimensional resource sharing systems. ⋮ Resource allocation under limited sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resource allocation under limited sharing
• On finding optimal and near-optimal lineal spanning trees
• Analysis of a Compound Bin Packing Algorithm
• Variable Sized Bin Packing