| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
On Equilibria for ADM Minimization Games. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
An efficient polynomial time approximation scheme for load balancing on uniformly related machines |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Bin packing with general cost structures. |
Math. Program. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Sven Oliver Krumke, Asaf Levin, Heike Sperber |
Selfish bin coloring. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Lene M. Favrholdt, Asaf Levin |
Online variable-sized bin packing with conflicts. |
Discrete Optimization |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Uri Yovel |
Uniform unweighted set cover: The power of non-oblivious local search. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev |
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Max-min Online Allocations with a Reordering Buffer. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
Graph coloring with rejection. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Robust Algorithms for Preemptive Scheduling. |
ESA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Csanád Imreh, Asaf Levin, Judit Nagy-György |
On Variants of File Caching. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Randomized algorithms for online bounded bidding. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items. |
SIAM Journal on Optimization |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Asaf Levin |
Covering the edges of bipartite graphs using K2, 2 graphs. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joan Boyar, Leah Epstein, Asaf Levin |
Tight results for Next Fit and Worst Fit with resource augmentation. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Improved randomized results for the interval selection problem. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Csanád Imreh, Asaf Levin |
Class constrained bin packing revisited. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Asaf Levin |
How to allocate review tasks for robust ranking. |
Acta Inf. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Betzalel Menahem |
Minimization of SONET ADMs in ring networks revisited. |
Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Csanád Imreh, Asaf Levin |
Class Constrained Bin Covering. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin |
On the sum minimization version of the online bin covering problem. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Max-min Online Allocations with a Reordering Buffer. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | János Csirik, Leah Epstein, Csanád Imreh, Asaf Levin |
Online Clustering with Variable Sized Clusters. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev |
Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Alberto Marchetti-Spaccamela, Nicole Megow, Julián Mestre, Martin Skutella, Leen Stougie |
Universal Sequencing on a Single Machine. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002, Asaf Levin |
Finding mobile data under delay constraints with searching costs. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
partitioning and scheduling, approximation algorithms, design and analysis of algorithms |
| 1 | Refael Hassin, Asaf Levin, Shlomi Rubinstein |
Approximation algorithms for maximum latency and partial cycle cover. |
Discrete Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Asaf Levin |
The multi-integer set cover and the facility terminal cover problem. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai |
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Geometric partitioning, Approximation algorithms, Batch scheduling |
| 1 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Variable Sized Online Interval Coloring with Bandwidth. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Interval coloring, Approximation algorithm, Lower bound, Competitive analysis |
| 1 | Asaf Levin |
A generalized minimum cost k-clustering. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin, Maxim Sviridenko |
Approximating the minimum quadratic assignment problems. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | José R. Correa, Asaf Levin |
Monotone Covering Problems with an Additional Covering Constraint. |
Math. Oper. Res. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
AFPTAS results for common variants of bin packing: A new method to handle the small items |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Asaf Levin, Uri Yovel |
Uniform unweighted set cover: The power of non-oblivious local search |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Julián Mestre, Danny Segev |
Improved approximation guarantees for weighted matching in the semi-streaming model |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Bin packing with general cost structures |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Online Capacitated Interval Coloring. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Better bounds for minimizing SONET ADMs. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
A robust APTAS for the classical bin packing problem. |
Math. Program. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
On Equilibria for ADM Minimization Games. |
SAGT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Michal Penn |
Approximation algorithm for minimizing total latency in machine scheduling with deliveries. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
More on online bin packing with two item sizes. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
A PTAS for delay minimization in establishing wireless conference calls. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
On Bin Packing with Conflicts. |
SIAM Journal on Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Online unit clustering: Variations on a theme. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Two-dimensional packing with conflicts. |
Acta Inf. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger |
The computational complexity of graph contractions II: Two tough polynomially solvable cases. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger |
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin |
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
An APTAS for Generalized Cost Variable-Sized Bin Packing. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Archer, Asaf Levin, David P. Williamson |
A Faster, Better Approximation Algorithm for the Minimum Latency Problem. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Improved Randomized Results for That Interval Selection Problem. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin |
The finite horizon investor problem with a budget constraint. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
SONET ADMs Minimization with Divisible Paths. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Brosh, Asaf Levin, Yuval Shavitt |
Approximation and heuristic algorithms for minimum-delay application-layer multicast trees. |
IEEE/ACM Trans. Netw. |
2007 |
DBLP DOI BibTeX RDF |
approximation algorithms, overlay networks, peer-to-peer communications |
| 1 | Refael Hassin, Asaf Levin |
Flow trees for vertex-capacitated networks. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin |
Approximating min-max k-clustering. |
Fair Division |
2007 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin, Rob van Stee |
Multi-dimensional Packing with Conflicts. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
On the Max Coloring Problem. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
Minimum Weighted Sum Bin Packing. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Asaf Levin |
Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithms, network design, set cover |
| 1 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Online Capacitated Interval Coloring. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Asaf Levin |
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms. |
Discrete Optimization |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin |
Real time scheduling with a budget: Parametric-search is better than binary search. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Asaf Levin |
Optimizing over Consecutive 1's and Circular 1's Constraints. |
SIAM Journal on Optimization |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
The conference call search problem in wireless networks. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Danny Segev |
Partial multicuts in trees. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
The minimum generalized vertex cover problem. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
complexity classification, Vertex cover, local-ratio |
| 1 | Esther M. Arkin, Refael Hassin, Asaf Levin |
Approximations for minimum and min-max vehicle routing problems. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Asaf Levin |
Methodologies and Algorithms for Group-Rankings Decision. |
Management Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Gerhard J. Woeginger |
The constrained minimum weighted sum of job completion times problem. |
Math. Program. |
2006 |
DBLP DOI BibTeX RDF |
Scheduling, Combinatorial optimization, Approximation scheme |
| 1 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
Graph Coloring with Rejection. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
A Robust APTAS for the Classical Bin Packing Problem. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Thomas Erlebach, Asaf Levin |
Variable Sized Online Interval Coloring with Bandwidth. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
On Bin Packing with Conflicts. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Asaf Levin |
The k-Allocation Problem and Its Variants. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin |
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai |
Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
The chord version for SONET ADMs minimization. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
An Approximation Algorithm for the Minimum Latency Set Cover Problem. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
Minimum sum set cover, minimum latency, approximation algorithm |
| 1 | Leah Epstein, Asaf Levin |
Tracking mobile users. |
Algorithms for Optimization with Incomplete Information |
2005 |
DBLP BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
SONET ADMs Minimization with Divisible Paths. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
The Conference Call Search Problem in Wireless Networks. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Danny Segev |
Partial Multicuts in Trees. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin |
Strongly polynomial-time approximation for a class of bicriteria problems. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin |
A better approximation algorithm for the budget prize collecting tree problem. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Approximation Algorithms for Quickest Spanning Tree Problems. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Quickest path problem, Minimum diameter spanning tree problem, Approximation algorithms |
| 1 | Jochen Könemann, Asaf Levin, Amitabh Sinha |
Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation |
| 1 | Refael Hassin, Asaf Levin |
Synthesis of 2-Commodity Flow Networks. |
Math. Oper. Res. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Minimum restricted diameter spanning trees. |
Discrete Applied Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
Approximation Algorithms for Quickest Spanning Tree Problems. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Asaf Levin, Gerhard J. Woeginger |
The Constrained Minimum Weighted Sum of Job Completion Times Problem. |
IPCO |
2004 |
DBLP DOI BibTeX RDF |
bicriteria optimization, scheduling, approximation scheme |
| 1 | Leah Epstein, Asaf Levin |
Better Bounds for Minimizing SONET ADMs. |
WAOA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Leah Epstein, Asaf Levin |
A PTAS for Delay Minimization in Establishing Wireless Conference Calls. |
WAOA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Olivier Goldschmidt, Dorit S. Hochbaum, Asaf Levin, Eli V. Olinick |
The SONET edge-partition problem. |
Networks |
2003 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")