| |
Reviews about "Nonnumerical Algorithms And Problems (F.2.2)":
|
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
Yuan J., Li W., Yuan J. Theoretical Computer Science 457174-180, 2012. Type: Article
|
Mathematics of discrete structures for computer science
Pace G., Springer Publishing Company, Incorporated, New York, NY, 2012. 309 pp. Type: Book (978-3-642298-39-4)
|
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
Karakostas G., Kolliopoulos S., Wang J. ACM Transactions on Algorithms 8(4): 1-16, 2012. Type: Article
|
A generalisation of Tverberg’s theorem
Soberón P., Strausz R. Discrete & Computational Geometry 47(3): 455-460, 2012. Type: Article
|
Scheduling on parallel identical machines with job-rejection and position-dependent processing times
Gerstl E., Mosheiov G. Information Processing Letters 112(19): 743-747, 2012. Type: Article
|
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters
Jain N., Menache I., Naor J., Yaniv J. SPAA 2012 (Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, Pittsburgh, PA, Jun 25-27, 2012) 255-266, 2012. Type: Proceedings
|
Fast algorithms for max independent set
Bourgeois N., Escoffier B., Paschos V., van Rooij J. Algorithmica 62(1-2): 382-415, 2012. Type: Article
|
more...
|
|
|
|
