Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
WADS
/
Paper
An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines.
Leah Epstein
,
Asaf Levin
Venue
B
WADS
Year
2025
Proceedings
WADS
DBLP record
conf/wads/EpsteinL25 ↗
Browse the full
WADS paper archive
.