42 results on '"LEVIN, ASAF"'
Search Results
2. The Near Exact Bin Covering Problem
3. Online Minimization of the Maximum Starting Time: Migration Helps
4. High-multiplicity N-fold IP via configuration LP
5. Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
6. Approximation Schemes for the Generalized Extensible Bin Packing Problem
7. More on ordered open end bin packing
8. Lower bounds for batched bin packing
9. A New Lower Bound for Classic Online Bin Packing
10. A Unified Framework for Designing EPTAS for Load Balancing on Parallel Machines
11. Lower Bounds for Several Online Variants of Bin Packing
12. Lower bounds for online bin covering-type problems
13. Min-Sum Bin Packing
14. Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem
15. Weighted matching with pair restrictions
16. Batch Coloring of Graphs
17. Online-bounded analysis
18. Discounted Reward TSP
19. Maximum coverage problem with group budget constraints
20. On nonlinear multi-covering problems
21. Vertex Cover Meets Scheduling
22. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases
23. An efficient polynomial time approximation scheme for load balancing on uniformly related machines
24. Online File Caching with Rejection Penalties
25. Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
26. Robust Algorithms for Preemptive Scheduling
27. Online Clustering with Variable Sized Clusters
28. On Equilibria for ADM Minimization Games
29. Approximation Schemes for Packing Splittable Items with Cardinality Constraints
30. Bin packing with general cost structures
31. How to allocate review tasks for robust ranking
32. Selfish bin coloring
33. Minimization of SONET ADMs in ring networks revisited
34. Class Constrained Bin Covering
35. Two-dimensional packing with conflicts
36. Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
37. A robust APTAS for the classical bin packing problem
38. Variable Sized Online Interval Coloring with Bandwidth
39. SONET ADMs Minimization with Divisible Paths
40. The constrained minimum weighted sum of job completion times problem
41. Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem
42. Approximation Algorithms for Quickest Spanning Tree Problems
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.