Výsledky vyhledávání - "Approximation algorithms for NP-hard problems"

Local Ratio: A Unified Framework for Approximation Algorithms

Autoři: R. Bar-Yehuda K. Bendel A. Freund a další

Přispěvatelé: R. Bar-Yehuda K. Bendel A. Freund a další

Zdroj: http://www.cs.technion.ac.il/~reuven/PS/survey.ps.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--Computations on discrete structures, Sequencing and scheduling General Terms, Algorithms, Performance Additional Key Words and Phrases, Approximation algorithms for NP-hard problems, dynamic storage allocation, general caching, scheduling, resource allocation

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.475; http://www.cs.technion.ac.il/~reuven/PS/survey.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.475
http://www.cs.technion.ac.il/~reuven/PS/survey.ps

A Unified Approach to Approximating Resource Allocation and Scheduling

Autoři: Amotz Bar-Noy Reuven Bar-Yehuda Ari Freund a další

Přispěvatelé: Amotz Bar-Noy Reuven Bar-Yehuda Ari Freund a další

Zdroj: http://www.cs.technion.ac.il/~arief/papers/unified-jacm.ps.

Témata: General Terms, Algorithms, Performance Additional Key Words and Phrases, Approximation algorithms for NP-hard problems, dynamic storage allocation, general caching, scheduling, resource allocation

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.385

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.385
http://www.cs.technion.ac.il/~arief/papers/unified-jacm.ps

A Unified Approach to Approximating Resource Allocation and Scheduling

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.sci.brooklyn.cuny.edu/~amotz/PUBLICATIONS/bw.ps.

Témata: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems--Computations on discrete structures, Sequencing and scheduling General Terms, Algorithms, Performance Additional Key Words and Phrases, Approximation algorithms for NP-hard problems, dynamic storage allocation, general caching, scheduling, resource allocation

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4260; http://www.sci.brooklyn.cuny.edu/~amotz/PUBLICATIONS/bw.ps

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.4260
http://www.sci.brooklyn.cuny.edu/~amotz/PUBLICATIONS/bw.ps