46 results on '"LEVIN, ASAF"'
Search Results
2. EPTAS for the dual of splittable bin packing with cardinality constraint
3. EPTAS for load balancing problem on parallel machines with a non-renewable resource
4. Online bin covering with limited migration
5. Approximate separable multichoice optimization over monotone systems
6. Starting time minimization for the maximum job variant
7. Robust algorithms for total completion time
8. Improved bounds for randomized preemptive online matching
9. Reducibility bounds of objective functions over the integers
10. Online cardinality constrained scheduling
11. Offline black and white bin packing
12. Min–max cover of a graph with a small number of parts
13. The benefit of adaptivity in stochastic packing problems with probing
14. Comparing the costs of Any Fit algorithms for bin packing
15. Bin covering with cardinality constraints
16. The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
17. On the max coloring problem
18. Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
19. Online variable-sized bin packing with conflicts
20. Scheduling with processing set restrictions: PTAS results for several variants
21. Uniform unweighted set cover: The power of non-oblivious local search
22. Parameterized complexity of configuration integer programs
23. Class constrained bin packing revisited
24. Improved randomized results for the interval selection problem
25. Tight results for Next Fit and Worst Fit with resource augmentation
26. Covering the edges of bipartite graphs using [formula omitted] graphs
27. Complexity, algorithms and applications of the integer network flow with fractional supplies problem
28. Approximation algorithms for maximum latency and partial cycle cover
29. More on online bin packing with two item sizes
30. Approximation algorithm for minimizing total latency in machine scheduling with deliveries
31. A PTAS for delay minimization in establishing wireless conference calls
32. Online unit clustering: Variations on a theme
33. A note on a variant of the online open end bin packing problem
34. Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
35. Partial multicuts in trees
36. The conference call search problem in wireless networks
37. Approximations for minimum and min-max vehicle routing problems
38. The chord version for SONET ADMs minimization
39. The benefit of preemption with respect to the [formula omitted] norm
40. Lexicographic local search and the p-center problem
41. Minimum spanning tree with hop restrictions
42. The benefit of preemption for single machine scheduling so as to minimize total weighted completion time
43. Shifted matroid optimization
44. Adaptivity in the stochastic blackjack knapsack problem
45. Strongly polynomial-time approximation for a class of bicriteria problems
46. A better approximation algorithm for the budget prize collecting tree problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.