An efficient approximation scheme for variable-sized bin packing
SIAM Journal on Computing
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Maximum bounded 3-dimensional matching is MAX SNP-complete
Information Processing Letters
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving Multiple Knapsack Problems by Cutting Planes
SIAM Journal on Optimization
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Stochastic Load Balancing and Related Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Throughput maximization of real-time scheduling with batching
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Polynominal time approximation schemes for class-constrained packing problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for 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
Minimizing Makespan and Preemption Costs on a System of Uniform Machines
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
On-line maximizing the number of items packed in variable-sized bins
Acta Cybernetica
Market sharing games applied to content distribution in ad-hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An evolutionary lagrangian method for the 0/1 multiple knapsack problem
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A sufficient condition for truthfulness with single parameter agents
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Approximation schemes for knapsack problems with shelf divisions
Theoretical Computer Science
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
Journal of Algorithms
Cell Breathing in Wireless LANs: Algorithms and Evaluation
IEEE Transactions on Mobile Computing
An efficient approximation for the generalized assignment problem
Information Processing Letters
Approximation algorithm for data mapping on block multi-threaded network processor architectures
Proceedings of the 44th annual Design Automation Conference
Scheduling algorithms for multi-carrier wireless data systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
IEEE/ACM Transactions on Networking (TON)
Efficient approximation of optimization queries under parametric aggregation constraints
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A request distribution method for clustered VOD servers considering buffer sharing effects
Journal of Systems Architecture: the EUROMICRO Journal
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Spectrum Bidding in Wireless Networks and Related
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Distributed Approximation of Cellular Coverage
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Parameterized approximation scheme for the multiple knapsack problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved approximation algorithms for scheduling with fixed jobs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Online Ad Assignment with Free Disposal
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Truthful assignment without money
Proceedings of the 11th ACM conference on Electronic commerce
The complexity of RP selection in multicast channelization
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Scheduling with bully selfish jobs
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Parameterized Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
Consideration set generation in commerce search
Proceedings of the 20th international conference on World wide web
Dynamic resource allocation for spot markets in clouds
Hot-ICE'11 Proceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services
A Practical Architecture for an Anycast CDN
ACM Transactions on the Web (TWEB)
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Mathematics of Operations Research
Scheduling algorithms for multicarrier wireless data systems
IEEE/ACM Transactions on Networking (TON)
End-to-end network QoS via scheduling of flexible resource reservation requests
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
How to place efficiently guards and paintings in an art gallery
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Distributed approximation of cellular coverage
Journal of Parallel and Distributed Computing
Improved approximation results for stochastic knapsack problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
Tight approximation algorithms for scheduling with fixed jobs and nonavailability
ACM Transactions on Algorithms (TALG)
A (1-1/e)-approximation algorithm for the generalized assignment problem
Operations Research Letters
Geometric quadrisection in linear time, with application to VLSI placement
Discrete Optimization
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
New polynomial-time instances to various knapsack-type problems
Fundamenta Informaticae
Design and implementation of an intelligent end-to-end network QoS system
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Scalable rule management for data centers
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Mechanisms for multi-unit combinatorial auctions with a few distinct goods
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Stochastic combinatorial optimization via poisson approximation
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Throughput-optimal resource allocation in LTE-Advanced with distributed antennas
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |