Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISAAC
/
Paper
An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering.
Klaus Jansen
,
Roberto Solis-Oba
Venue
B
ISAAC
Year
2002
Proceedings
ISAAC
DBLP record
conf/isaac/JansenS02 ↗
Browse the full
ISAAC paper archive
.