`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

@article{Garey1978S,
  title={`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications},
  author={M. Garey and D. Johnson},
  journal={J. ACM},
  year={1978},
  volume={25},
  pages={499-508}
}
The NP-completeness of a computational problem ~s frequently taken to unply its "mtractabthty" However, there are certain NP-complete problems mvolvmg numbers, such as PARTITION and KNAPSACK, which are considered by many practitioners to be tractable The reason for this IS that, although no algontluns for solvmg them in tune bounded by a polynomial m the mput length are known, algorithms are known which solve them m tune bounded by a polynomial m the input length and the magmtude of the largest… Expand
Constructing NP-intermediate problems by blowing holes with parameters of various properties
TLDR
This article identifies a new method for obtaining constraint languages ? such that CSP ( ? ) are NP-intermediate and proves that the propositional abduction problem parameterized by constraint languages admits NP-Intermediate problems. Expand
A guide to complexity theory in operations research
It is a well-known fact that there exists an ever increasing number of problems for which, despite the efforts of many inventive and persistent researchers, it seems virtually impossible to findExpand
Blowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction
TLDR
First, it is proved that the propositional abduction problem parameterized by constraint languages admits NP-intermediate problems, and a new method is identified for obtaining constraint languages Γ such that CSPΓ are NP-Intermediate. Expand
Proof verification and the hardness of approximation problems
TLDR
It is proved that no MAX SNP-hard problem has a polynomial time approximation scheme, unless NP = P, and there exists a positive ε such that approximating the maximum clique size in an N-vertex graph to within a factor of Nε is NP-hard. Expand
On Strong NP-Completeness of Rational Problems
TLDR
It is shown that all of these problems in this setting become strongly NP-complete and, as a result, no pseudo-polynomial algorithm can exist for solving them unless P=NP. Expand
Proof verification and hardness of approximation problems
TLDR
The authors improve on their result by showing that NP=PCP(logn, 1), which has the following consequences: (1) MAXSNP-hard problems do not have polynomial time approximation schemes unless P=NP; and (2) for some epsilon >0 the size of the maximal clique in a graph cannot be approximated within a factor of n/sup ePSilon / unless P =NP. Expand
A Brief History of NP-Completeness, 1954-2012
TLDR
This chapter shall briefly sketch the history and pre-history of NP-completeness, and provide a brief personal survey of the developments in the theory over the last 40 years and their impact (or lack thereof) on the practice and theory of optimization. Expand
Bounding the Bandwidth of NP-Complete Problems
TLDR
It is shown how the computational behaviour of NIP-complete graph problems is influenced by imposing a bound on the bandwidth, indicating that "bandwidth" plays the same role for graph problems as "maximal number" does for number problems. Expand
Non Deterministic Polynomial Optimization Problems and their Approximations
Abstract A unified and general framework for the study of nondeterministic polynomial optimization problems (NPOP) is presented and some properties of NPOP's are investigated. A characterization ofExpand
NP-Complete operations research problems and approximation algorithms
  • P. Brucker
  • Mathematics, Computer Science
  • Z. Oper. Research
  • 1979
TLDR
A survey onNP-complete andNP-hard problems and on approximation algorithms is given and concepts introduced are illustrated by examples which are closely related to the knapsack problem and can be understood easily. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 32 REFERENCES
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
TLDR
An algorithm is presented which finds for any 0 < e < 1 an approximate solution P satisfying (P* P)/P* < ~, where P* is the desired optimal sum. Expand
On the Structure of Polynomial Time Reducibility
  • R. Ladner
  • Mathematics, Computer Science
  • JACM
  • 1975
TLDR
The method of showing density ymlds the result that if P ~ NP then there are members of NP -P that are not polynomml complete is shown, which means there is a strictly ascending sequence with a minimal pair of upper bounds to the sequence. Expand
NP-Complete Scheduling Problems
  • J. Ullman
  • Computer Science
  • J. Comput. Syst. Sci.
  • 1975
TLDR
It is shown that the problem of finding an optimal schedule for a set of jobs is NP-complete even in the following two restricted cases, tantamount to showing that the scheduling problems mentioned are intractable. Expand
The Complexity of Flowshop and Jobshop Scheduling
TLDR
The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths. Expand
Complexity Results for Multiprocessor Scheduling under Resource Constraints
TLDR
The main results of this paper imply that almost all cases of this scheduling problem, even with only one resource, are NP-complete and hence are as difficult as the notorious traveling salesman problem. Expand
On the Computational Complexity of Combinatorial Problems
  • R. Karp
  • Computer Science
  • Networks
  • 1975
A large class of classical combinatorial problems, including most of the difficult problems in the literature of network flows and computational graph theory, are shown to be equivalent, in the senseExpand
Complexity of machine scheduling problems
TLDR
A classification of scheduling problems on single, different and identical machines is given and NP-completeness is established for a large number of other machine scheduling problems. Expand
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
TLDR
Exact and approximate algorithms are presented for scheduling independent tasks in a multiprocessor environment in which the processors have different speeds and are guaranteed to obtain solutions that are close to the optimal. Expand
The Design and Analysis of Computer Algorithms
TLDR
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs. Expand
Some complexity results for the Traveling Salesman Problem
It is shown that, unless P&equil;NP, local search algorithms for the Traveling Salesman Problem having polynomial time complexity per iteration will generate solutions arbitrarily far from theExpand
...
1
2
3
4
...