Results 291 to 300 of about 742,132 (325)
Some of the next articles are maybe not open access.
Greedy Approximation Algorithms
2013Greedy strategy is a simple and natural method in the design of approximation algorithms. This chapter presents greedy approximation algorithms for very broad classes of maximization problems and minimization problems and analyzes their approximation bounds.
openaire +1 more source
Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97), 2005
openaire +2 more sources
openaire +2 more sources
Approximation and online algorithms for multidimensional bin packing: A survey
Computer Science Review, 2017Henrik I Christensen, Arindam Khan
exaly

