Asaf Levin
Asaf Levin
Associate Professor in Operations Research, The Technion
Verified email at - Homepage
Cited by
Cited by
Approximations for minimum and min-max vehicle routing problems
EM Arkin, R Hassin, A Levin
Journal of Algorithms 59 (1), 1-18, 2006
Methodologies and algorithms for group-rankings decision
DS Hochbaum, A Levin
Management Science 52 (9), 1394-1408, 2006
Approximation and heuristic algorithms for minimum-delay application-layer multicast trees
E Brosh, A Levin, Y Shavitt
IEEE/ACM Transactions on Networking 15 (2), 473-484, 2007
Improved approximation guarantees for weighted matching in the semi-streaming model
L Epstein, A Levin, J Mestre, D Segev
SIAM Journal on Discrete Mathematics 25 (3), 1251-1265, 2011
On bin packing with conflicts
L Epstein, A Levin
SIAM Journal on Optimization 19 (3), 1270-1298, 2008
The SONET edge‐partition problem
O Goldschmidt, DS Hochbaum, A Levin, EV Olinick
Networks: An International Journal 41 (1), 13-23, 2003
A faster, better approximation algorithm for the minimum latency problem
A Archer, A Levin, DP Williamson
SIAM Journal on Computing 37 (5), 1472-1498, 2008
Universal sequencing on an unreliable machine
L Epstein, A Levin, A Marchetti-Spaccamela, N Megow, J Mestre, ...
SIAM Journal on Computing 41 (3), 565-586, 2012
A better-than-greedy approximation algorithm for the minimum set cover problem
R Hassin, A Levin
SIAM Journal on Computing 35 (1), 189-200, 2005
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection
R Hassin, A Levin
SIAM Journal on Computing 33 (2), 261-268, 2004
The (weighted) metric dimension of graphs: hard and easy cases
L Epstein, A Levin, GJ Woeginger
Algorithmica 72 (4), 1130-1171, 2015
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
A Levin
International Workshop on Approximation and Online Algorithms, 290-301, 2006
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
DS Hochbaum, A Levin
Discrete Optimization 3 (4), 327-340, 2006
Better bounds for minimizing SONET ADMs
L Epstein, A Levin
International Workshop on Approximation and Online Algorithms, 281-294, 2004
Improved bounds for online preemptive matching
L Epstein, A Levin, D Segev, O Weimann
arXiv preprint arXiv:1207.1788, 2012
An APTAS for generalized cost variable-sized bin packing
L Epstein, A Levin
SIAM Journal on Computing 38 (1), 411-428, 2008
A parameterized strongly polynomial algorithm for block structured integer programs
M Kouteckı, A Levin, S Onn
arXiv preprint arXiv:1802.05859, 2018
Approximating the degree-bounded minimum diameter spanning tree problem
J Könemann, A Levin, A Sinha
Algorithmica 41 (2), 117-129, 2005
AFPTAS results for common variants of bin packing: A new method for handling the small items
L Epstein, A Levin
SIAM Journal on Optimization 20 (6), 3121-3145, 2010
Robust algorithms for preemptive scheduling
L Epstein, A Levin
Algorithmica 69 (1), 26-57, 2014
The system can't perform the operation now. Try again later.
Articles 1–20