NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (20)

cs.DS2019

Online Bin Covering with Limited Migration

Sebastian Berndt, Leah Epstein, Klaus Jansen +3

math.OC2018

Optimization over Degree Sequences

Antoine Deza, Asaf Levin, Syed M. Meesum +1

math.OC2017

Approximate Shifted Combinatorial Optimization

Martin Koutecky, Asaf Levin, Syed M. Meesum +1

cs.DS2012

Improved Bounds for Online Preemptive Matching

Leah Epstein, Asaf Levin, Danny Segev +1

cs.DS2014

Minimum total weighted completion time: Faster approximation schemes

Leah Epstein, Asaf Levin

cs.DS2017

Lower bounds for several online variants of bin packing

János Balogh, József Békési, György Dósa +2

cs.DS2016

Batch Coloring of Graphs

Joan Boyar, Leah Epstein, Lene M. Favrholdt +2

cs.DS2009

AFPTAS results for common variants of bin packing: A new method to handle the small items

Leah Epstein, Asaf Levin

cs.DS2018

A unified framework for designing EPTAS's for load balancing on parallel machines

Ishai Kones, Asaf Levin

cs.DS2009

Bin packing with general cost structures

Leah Epstein, Asaf Levin

cs.DS2018

A new lower bound for classic online bin packing

János Balogh, József Békési, György Dósa +2

cs.DS2017

Online Bounded Analysis

Joan Boyar, Leah Epstein, Lene M. Favrholdt +2

cs.DS2012

An efficient polynomial time approximation scheme for load balancing on uniformly related machines

Leah Epstein, Asaf Levin

math.OC2015

Shifted Matroid Optimization

Asaf Levin, Shmuel Onn

cs.DS2017

A new and improved algorithm for online bin packing

János Balogh, József Békési, György Dósa +2

cs.DS2012

A unified approach to truthful scheduling on related machines

Leah Epstein, Asaf Levin, Rob van Stee

cs.DS2009

Improved approximation guarantees for weighted matching in the semi-streaming model

Leah Epstein, Asaf Levin, Julian Mestre +1

cs.DS2009

Uniform unweighted set cover: The power of non-oblivious local search

Asaf Levin, Uri Yovel

cs.DS2019

Approximation schemes for the generalized extensible bin packing problem

Asaf Levin

cs.DS2016

Online bin packing with cardinality constraints resolved

János Balogh, József Békési, György Dósa +2