The following pages link to Asaf Levin (Q270024):
Displaying 50 items.
- Vertex cover meets scheduling (Q270025) (← links)
- An AFPTAS for variable sized bin packing with general activation costs (Q340560) (← links)
- Adaptivity in the stochastic blackjack knapsack problem (Q385968) (← links)
- Selfish bin coloring (Q411255) (← links)
- Online variable-sized bin packing with conflicts (Q429693) (← links)
- An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- The benefit of adaptivity in stochastic packing problems with probing (Q476898) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- The (weighted) metric dimension of graphs: hard and easy cases (Q494798) (← links)
- On nonlinear multi-covering problems (Q511715) (← links)
- Uniform unweighted set cover: the power of non-oblivious local search (Q631761) (← links)
- Graph coloring with rejection (Q632809) (← links)
- On the max coloring problem (Q690449) (← links)
- A better approximation algorithm for the budget prize collecting tree problem. (Q703233) (← links)
- Strongly polynomial-time approximation for a class of bicriteria problems. (Q703276) (← links)
- How to allocate review tasks for robust ranking (Q707596) (← links)
- Min-sum bin packing (Q721936) (← links)
- Randomized algorithms for online bounded bidding (Q763539) (← links)
- The chord version for SONET ADMs minimization (Q817808) (← links)
- Approximation schemes for the generalized extensible bin packing problem (Q832515) (← links)
- Real time scheduling with a budget: parametric-search is better than binary search (Q845717) (← links)
- Partial multicuts in trees (Q861281) (← links)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
- Flow trees for vertex-capacitated networks (Q869579) (← links)
- A PTAS for delay minimization in establishing wireless conference calls (Q924635) (← links)
- Approximation algorithm for minimizing total latency in machine scheduling with deliveries (Q924636) (← links)
- Two-dimensional packing with conflicts (Q929297) (← links)
- Online unit clustering: Variations on a theme (Q954982) (← links)
- More on online bin packing with two item sizes (Q955329) (← links)
- Class constrained bin covering (Q970104) (← links)
- Tight results for next fit and worst fit with resource augmentation (Q974751) (← links)
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing (Q975519) (← links)
- Class constrained bin packing revisited (Q986543) (← links)
- Improved randomized results for the interval selection problem (Q986549) (← links)
- On the sum minimization version of the online bin covering problem (Q987687) (← links)
- Better bounds for minimizing SONET ADMs (Q1004601) (← links)
- A robust APTAS for the classical bin packing problem (Q1013966) (← links)
- Approximation algorithms for maximum latency and partial cycle cover (Q1015324) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216) (← links)
- Lexicographic local search and the \(p\)-center problem. (Q1410610) (← links)
- Minimum restricted diameter spanning trees. (Q1427810) (← links)
- Online-bounded analysis (Q1617274) (← links)
- On the performance guarantee of first fit for sum coloring (Q1628787) (← links)
- A unified framework for designing EPTAS's for load balancing on parallel machines (Q1670744) (← links)
- Maximum coverage problem with group budget constraints (Q1680483) (← links)
- Shifted matroid optimization (Q1694792) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
