Skip to main navigation
Skip to search
Skip to main content

Princeton University Home

Help & FAQ

Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media

Search by expertise, name or affiliation

Approximability of NP-hard problems

Computer Science
Bendheim Center for Finance
Center for Statistics & Machine Learning
Princeton Language and Intelligence (PLI)

Research output: Contribution to journal › Conference article › peer-review

44 Scopus citations

Overview
Fingerprint

Fingerprint

Dive into the research topics of 'Approximability of NP-hard problems'. Together they form a unique fingerprint.

Sort by
Weight
Alphabetically

Mathematics

Computer Science

Keyphrases

Powered by Pure, Scopus & Elsevier Fingerprint Engine™

All content on this site: Copyright © 2024 Elsevier B.V. or its licensors and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the Creative Commons licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

About web accessibility

Report vulnerability