Reducibility Among Combinatorial Problems

  title={Reducibility Among Combinatorial Problems},
  author={Richard M. Karp},
  booktitle={50 Years of Integer Programming},
  • R. Karp
  • Published in
    50 Years of Integer…
  • Computer Science
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held. These experiences made me aware that seemingly simple discrete optimization problems could hold the seeds of combinatorial explosions. The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient… 

An empirical examination of exact algorithms for the Cardinality Steiner Problem

It is shown that the implicit enumeration technique of Shore, Foulds, and Gibbons outperforms the others almost universally and a characterization of those instances for which it performsOpoorly is given and a means of overcoming this shortcoming suggested.

New approaches to integer programming

A combinatorial approach is used to give an approximation algorithm for the feedback vertex set problem (FVS) in a recently developed Implicit Hitting Set framework and an unexplored geometric connection between integer feasibility and the classical notion of discrepancy of matrices is presented.

Polynomially Reducing the Clique Problem to the SAT Problem with DIMACS Encoding

Among the many other NP-complete problems that are studied by mathematicians and computer scientists today is the Boolean Satisfiability Problem (SAT). With this problem, we ask, ”Does there exist an

Provably Good Global Routing of Integrated Circuits

This paper investigates the global routing problem for integrated circuits. We introduce a formulation on the basis of integer programming which minimizes the routing area among a limited set of

On provably best construction heuristics for hard combinatorial optimization problems

In this article, a heuristic is said to be provably best if, assuming P ≠ N P , no other heuristic always finds a better solution (when one exists). This extends the usual notion of “best possible”

borealis—A generalized global update algorithm for Boolean optimization problems

This work presents a generalized global update optimization heuristic that can be applied to different NP-complete problems with Boolean variables, and illustrates the efficiency of the heuristic on paradigmatic optimization problems, such as the maximum satisfiability problem and the vertex cover problem.

Applying Modern SAT-solvers to Solving Hard Problems

Nine SAT-solvers are presented and it is shown that they behave quite efficiently for NP-complete and harder problems but they are by far inferior to tailored algorithms for specific problems of lower complexity.

Cable tree wiring - benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints

This paper studies the problem of deriving the optimal wiring sequence for a given layout of a cable tree, discusses various modeling variants for the problem, proves its NP-hardness, and empirically compare CP, OMT, and MIP solvers on a benchmark set of 278 instances.


This thesis presents two applications of combinatorial optimization and describes a project called the Boat Allocation Module, where a team comprised of United States Coast Guard analysts, and Command, Control, and Interoperability Center for Advanced Data Analysis researchers worked.

Graph Algorithm Alternatives via Polynomial-Time Transformations: An Empirical Study Using Boolean Satisfiability and Integer Linear Programming

This study is aimed at determining whether highly efficient SAT and ILP algorithms can outperform fast, direct clique algorithms, and if so, under what conditions, and whether foreknowledge of input graph structure has the potential to aid in proper algorithm selection.




A large class of combinatorial problems have been shown by Cook and Karp to be computationally equivalent to within a polynomial. We exhibit some new problems in this class, and provide simpler

The complexity of theorem-proving procedures

  • S. Cook
  • Mathematics, Computer Science
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a