Approximation algorithms for scheduling unrelated parallel machines
Scheduling Parallel Machines On-Line
Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
A unified approach to approximation algorithms for bottleneck problems
An approximation algorithm for the generalized assignment problem
Analyzing the Held-Karp tsp bound: a monotonicity property with application
SIAM Journal on Computing
Mathematical Programming
Operations Research
Journal of the ACM
Information Processing Letters
Éva Tardos
David P. Williamson
Dorit S. Hochbaum
Zuo-Jun Max Shen
Jan Karel Lenstra
Paat Rusmevichientong
Revealed Preference at Scale
Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks
A unified approach to scheduling on unrelated parallel machines
A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems
Selfish load balancing and atomic congestion games
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems