CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Filters
18,981 research outputs found
Inapproximability of Combinatorial Optimization Problems
Author
Trevisan Luca
Publication venue
Publication date
01/01/2004
Field of study
Full text link
We survey results on the hardness of approximating combinatorial optimization problems
arXiv.org e-Print Archive
CiteSeerX
1
2
3
…
last