Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?
Johan Hstad
Venue
A*
ICALP
Year
2000
Proceedings
ICALP
DBLP record
conf/icalp/Hastad00 ↗
Browse the full
ICALP paper archive
.