Skip to search formSkip to main contentSkip to account menu

Karp's 21 NP-complete problems

Known as: Karp’s 21 NP-complete problems, Reducibility among combinatorial problems 
In computational complexity theory, Karp's 21 NP-complete problems are a set of computational problems which are NP-complete. In his 1972 paper… 
Wikipedia (opens in a new tab)

Related topics

Related topics

37 relations
3-dimensional matchingBoolean satisfiability problemClique (graph theory)Clique cover

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Analysis of the suitability of using blind crossover operators in genetic algorithms for solving routing problems
Genetic algorithms (GA) are one of the most successful techniques in solving combinatorial optimization problems. Its general… 
Highly Cited
2012
Highly Cited
2012
On Managing Quality of Experience of Multiple Video Streams in Wireless Networks
Managing the Quality-of-Experience (QoE) of video streaming for wireless clients is becoming increasingly important due to the… 
2006
2006
Syntactic Rule Based Approach toWeb Service Composition
This paper studies a problem of web service composition from a syntactic approach. In contrast with other approaches on enriched… 
Highly Cited
2006
Highly Cited
2006
Modeling dependencies in product families with COVAMOF
Many variability modeling approaches consider only formalized dependencies, i.e. in- or exclude relations between variants… 
2002
2002
An efficient characteristic Galerkin scheme for the advection equation in 3-D
2001
2001
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability
We show that, for every choice of an oriented cycle H, the problem of whether an input digraph G has a homomorphism to H is… 
Highly Cited
2000
Highly Cited
2000
Allocation of Splitting Nodes in All-Optical Wavelength-Routed Networks
In this paper, we introduce the splitter placement problem in wavelength-routed networks (SP-WRN). Given a network topology, a… 
Highly Cited
1984
Highly Cited
1984
An Unconstrained Topological Via Minimization Problem for Two-Layer Routing
Based on graph theory, a study of via minimization problem is presented. We show that the simplest problem of this type is NP… 
Highly Cited
1982
Highly Cited
1982
Some facets of the simple plant location polytope
We relate the simple plant location problem to the vertex packing problem and derive several classes of facets of their… 
Highly Cited
1980
Highly Cited
1980
Recognizing Disguised NR(1) Instances of the Satisfiability Problem
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)