Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
Combinatorica - Theory of Computing
Online algorithms for a dual version of bin packing
Discrete Applied Mathematics
Probabilistic construction of deterministic algorithms: approximating packing integer programs
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
Probabilistic analysis of algorithms for dual bin packing problems
Journal of Algorithms
Parallel database systems: the future of high performance database systems
Communications of the ACM
Improved approximations of packing and covering problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Multi-dimensional resource scheduling for parallel queries
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Scheduling issues in multimedia query optimization
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating k-Set Cover and Complementary Graph Coloring
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Zero Knowledge and the Chromatic Number
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
A probabilistic analysis of multidimensional bin packing problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A polynomial-time approximation scheme for maximizing the minimum machine completion time
Operations Research Letters
Scheduling data transfers in a network and the set scheduling problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for data placement on parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Stream-Packing: Resource Allocation in Web Server Farms with a QoS Guarantee
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Approximation Schemes for Ordered Vector Packing Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On the Approximability of Interactive Knapsack Problems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Vector Assignment Problems: A General Framework
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
Theoretical Computer Science
New approximability and inapproximability results for 2-dimensional Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
Vector assignment problems: a general framework
Journal of Algorithms
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A two-dimensional vector packing model for the efficient use of coil cassettes
Computers and Operations Research
Pareto approximations for the bicriteria scheduling problem
Journal of Parallel and Distributed Computing
Quorum placement in networks: minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Algorithms for non-uniform size data placement on parallel disks
Journal of Algorithms
A decision support system for luggage typesetting
Expert Systems with Applications: An International Journal
Hardness of approximation for orthogonal rectangle packing and covering problems
Journal of Discrete Algorithms
Approximation algorithms for data placement on parallel disks
ACM Transactions on Algorithms (TALG)
The train delivery problem: vehicle routing meets bin packing
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Energy-Aware Ant Colony Based Workload Placement in Clouds
GRID '11 Proceedings of the 2011 IEEE/ACM 12th International Conference on Grid Computing
Inapproximability results for orthogonal rectangle packing problems with rotations
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Operations Research Letters
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
Partitioning sporadic task systems upon memory-constrained multiprocessors
ACM Transactions on Embedded Computing Systems (TECS)
CloudOptimizer: multi-tenancy for I/O-bound OLAP workloads
Proceedings of the 16th International Conference on Extending Database Technology
RTP: robust tenant placement for elastic in-memory database clusters
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Non-cooperative games on multidimensional resource allocation
Future Generation Computer Systems
A multi-resource load balancing algorithm for cloud cache systems
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Stochastic combinatorial optimization via poisson approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the weak computability of a four dimensional orthogonal packing and time scheduling problem
Theoretical Computer Science
Mixed-criticality scheduling on multiprocessors
Real-Time Systems
| Hi-index | 0.00 |