249 results on '"LEVIN, ASAF"'
Search Results
2. Selecting intervals to optimize the design of observational studies subject to fine balance constraints
3. EPTAS for parallel identical machine scheduling with time restrictions
4. Scheduling with cardinality dependent unavailability periods
5. Online Minimization of the Maximum Starting Time: Migration Helps
6. High-multiplicity N-fold IP via configuration LP
7. Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
8. EPTAS for the dual of splittable bin packing with cardinality constraint
9. EPTAS for load balancing problem on parallel machines with a non-renewable resource
10. Online bin covering with limited migration
11. Lower bounds for batched bin packing
12. Approximate separable multichoice optimization over monotone systems
13. Starting time minimization for the maximum job variant
14. Approximation Schemes for the Generalized Extensible Bin Packing Problem
15. More on ordered open end bin packing
16. A New Lower Bound for Classic Online Bin Packing
17. Robust algorithms for total completion time
18. Improved bounds for randomized preemptive online matching
19. Lower Bounds for Several Online Variants of Bin Packing
20. Lower bounds for online bin covering-type problems
21. A Unified Framework for Designing EPTAS for Load Balancing on Parallel Machines
22. Batch Coloring of Graphs
23. Online-bounded analysis
24. Min-Sum Bin Packing
25. Weighted matching with pair restrictions
26. Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
27. A Unified Approach to Truthful Scheduling on Related Machines
28. Reducibility bounds of objective functions over the integers
29. Online cardinality constrained scheduling
30. Algorithms and Complexities of Matching Variants in Covariate Balancing.
31. Offline black and white bin packing
32. Min–max cover of a graph with a small number of parts
33. The benefit of adaptivity in stochastic packing problems with probing
34. On nonlinear multi-covering problems
35. Discounted Reward TSP
36. Maximum coverage problem with group budget constraints
37. Comparing the costs of Any Fit algorithms for bin packing
38. Bin covering with cardinality constraints
39. The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
40. On the max coloring problem
41. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
42. Online File Caching with Rejection Penalties
43. Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
44. Monotone Covering Problems with an Additional Covering Constraint
45. Online variable-sized bin packing with conflicts
46. Scheduling with processing set restrictions: PTAS results for several variants
47. Uniform unweighted set cover: The power of non-oblivious local search
48. Methodologies and Algorithms for Group-Rankings Decision
49. Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
50. An efficient polynomial time approximation scheme for load balancing on uniformly related machines
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.