Volgen
Asaf Levin
Asaf Levin
Associate Professor in Operations Research, The Technion
Geverifieerd e-mailadres voor technion.ac.il - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Methodologies and algorithms for group-rankings decision
DS Hochbaum, A Levin
Management Science 52 (9), 1394-1408, 2006
1902006
Approximations for minimum and min-max vehicle routing problems
EM Arkin, R Hassin, A Levin
Journal of Algorithms 59 (1), 1-18, 2006
1782006
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
1392007
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
1142011
On bin packing with conflicts
L Epstein, A Levin
SIAM Journal on Optimization 19 (3), 1270-1298, 2008
1042008
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
81*2008
The SONET edge‐partition problem
O Goldschmidt, DS Hochbaum, A Levin, EV Olinick
Networks: An International Journal 41 (1), 13-23, 2003
802003
The (weighted) metric dimension of graphs: hard and easy cases
L Epstein, A Levin, GJ Woeginger
Algorithmica 72 (4), 1130-1171, 2015
702015
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
662005
An algorithmic theory of integer programming
F Eisenbrand, C Hunkenschröder, KM Klein, M Koutecký, A Levin, S Onn
arXiv preprint arXiv:1904.01361, 2019
642019
A new and improved algorithm for online bin packing
J Balogh, J Békési, G Dósa, L Epstein, A Levin
arXiv preprint arXiv:1707.01728, 2017
642017
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
63*2012
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
622004
A parameterized strongly polynomial algorithm for block structured integer programs
M Koutecký, A Levin, S Onn
arXiv preprint arXiv:1802.05859, 2018
602018
Improved bounds for randomized preemptive online matching
L Epstein, A Levin, D Segev, O Weimann
Information and Computation 259, 31-40, 2018
52*2018
A robust APTAS for the classical bin packing problem
L Epstein, A Levin
Mathematical Programming 119 (1), 33-49, 2009
522009
Robust algorithms for preemptive scheduling
L Epstein, A Levin
Algorithmica 69 (1), 26-57, 2014
502014
Better bounds for minimizing SONET ADMs
L Epstein, A Levin
Journal of Computer and System Sciences 75 (2), 122-136, 2009
50*2009
Approximating the Unweighted -Set Cover Problem: Greedy Meets Local Search
A Levin
SIAM Journal on Discrete Mathematics 23 (1), 251-264, 2009
482009
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
DS Hochbaum, A Levin
Discrete Optimization 3 (4), 327-340, 2006
482006
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20