Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
What every computer scientist should know about floating-point arithmetic
ACM Computing Surveys (CSUR)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Advances in computational and stochastic optimization, logic programming, and heuristic search
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic Programming
IStar: A Raster Representation for Scalable Image and Volume Data
IEEE Transactions on Visualization and Computer Graphics
Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
A survey on offline scheduling with rejection
Journal of Scheduling
Hi-index | 0.00 |