OpenAlex
PricingAboutJobs
Log inGet started
Work

Structure in Approximation Classes

HTML

Year: 1995
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Computing and Combinatorics: First Annual International Conference, COCOON '95 Xi'an, China, August 24–26, 1995 Proceedings
DOI: 10.1007/bfb0030875
Authors: P. Crescenzi, V. Kann, R. Silvestri, L. Trevisan
Institutions: Sapienza University of Rome, KTH Royal Institute of Technology
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: approximation classes, NP-hard optimization, APX-completeness, query complexity

Open Access status: closed
OpenAlex ID: W11978745
FWCI: 4.502
Cites: 48
Cited by: 37
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security