Journal Article10.1145/321958.321975
P-Complete Approximation Problems
Sartaj Sahni,Teofilo F. Gonzalez +1 more
1.8K
TL;DR: For P- complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is also P-complete.
read more
Abstract: For P-complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is also P-complete. In contrast with these results, a linear time approximation algorithm for the clustering problem is presented.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Nonlinear threshold accepting meta-heuristic for combinatorial optimisation problems
Nabil Nahas,Mustapha Nourelfath +1 more
TL;DR: The newly developed meta-heuristic is applied to difficult instances of four combinatorial optimisation problems, namely quadratic assignment problem, dynamic discrete facility layout problems, flow-shop scheduling and berth allocation, and shows that it can be used as a specialised heuristic for these problems.
15
Utilization aware and network I/O intensive virtual machine placement policies for cloud data center
TL;DR: In this article , the authors consider a variant of the VMP, taking into account the communication among the VMs, and introduce the concept of Virtual Cluster, made up of VMs communicating among themselves.
15
An Overview of Complexity Theory in Discrete Optimization: Part II. Results and Implications
R. Gary Parker,Ronald L. Rardin +1 more
TL;DR: The implications of NP-Hardness, NP-Completeness,NP-Equivalency, the NP≠NP conjecture, and various approximations are investigated.
15
An analytical study of GPU computation for solving QAPs by parallel evolutionary computation with independent run
Shigeyoshi Tsutsui,Noriyuki Fujimoto +1 more
- 18 Jul 2010
TL;DR: An evolutionary algorithm for solving QAPs with parallel independent run using GPU computation that achieves a GPU computation performance that is nearly proportional to the number of equipped multi-processors in the GPUs.
Optimization of automated high-speed modular placement machines using knowledge-based systems
P. Csaszar,Peter C. Nelson,R.R. Rajbhandari,Thomas M. Tirpak +3 more
- 01 Nov 2000
TL;DR: An optimizer for a new family of modular, multistation, walking beam, high-speed chip mounters in a manner that would streamline the use of nozzles and part feeder mechanisms and at the same time increase throughput.
15
References
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: 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, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
The complexity of theorem-proving procedures
Stephen A. Cook
- 03 May 1971
TL;DR: 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 tautology.
7.4K
Bounds on Multiprocessing Timing Anomalies
TL;DR: An apparatus for generating sparks over a selected area to be used for theatrical effects.
2.6K
Approximation algorithms for combinatorial problems
TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.
2.5K
Approximation algorithms for combinatorial problems
David S. Johnson
- 30 Apr 1973
TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as 0(nε), where n is the problem size and ε> 0 depends on the algorithm.
1.6K