Asymptotic differential approximation ratio : definitions, motivations and application to some combinatorial problems
Marc Demange, Vangelis Th. Paschos (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Marc Demange, Vangelis Th. Paschos (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Vangelis Th. Paschos (2009)
The Yugoslav Journal of Operations Research
Similarity:
Pooya Hatami (2007)
Discussiones Mathematicae Graph Theory
Similarity:
We introduce a 2-factor approximation algorithm for the minimum total covering number problem.
Albert Cohen (2009)
Bollettino dell'Unione Matematica Italiana
Similarity:
We discuss the performances of greedy algorithms for two problems of numerical approximation. The first one is the best approximation of an arbitrary function by an N-terms linear combination of simple functions adaptively picked within a large dictionary. The second one is the approximation of an arbitrary function by a piecewise polynomial function on an optimally adapted triangulation of cardinality N. Performance is measured in terms of convergence rate with respect to the number...
Luke Finlay, Prabhu Manyem (2006)
RAIRO - Operations Research
Similarity:
We consider the NP Hard problems of online Bin Covering and Packing while requiring that larger (or longer, in the one dimensional case) items be placed at the bottom of the bins, below smaller (or shorter) items — we call such a version, the version of problems. Bin sizes can be uniform or variable. We look at computational studies for both the Best Fit and Harmonic Fit algorithms for uniform sized bin covering. The Best Fit heuristic for this version of the problem is introduced...
Fernando Cobos (1988)
Colloquium Mathematicae
Similarity:
J. Prasad (1972)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
P. L. Papini (1987)
Matematički Vesnik
Similarity:
R. B. Saxena (1962)
Annales Polonici Mathematici
Similarity: