Publication:4472463
From MaRDI portal
zbMath1044.90501MaRDI QIDQ4472463
Andrea Vitaletti, Stefano Leonardi, Alberto Marchetti-Spaccamela
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1974/19740409.htm
90B18: Communication networks in operations research
90C27: Combinatorial optimization
68W25: Approximation algorithms
Related Items
A constant factor approximation algorithm for the storage allocation problem, Resource allocation with time intervals, Resource allocation in bounded degree trees, Flexible bandwidth assignment with application to optical networks, Flexible resource allocation to interval jobs, A competitive scheduling problem and its relevance to UMTS channel assignment