P-Complete Approximation Problems

Authors:
Sartaj Sahni;Teofilo Gonzalez
Affiliations:
Department of Computer Science, 114 Lind Hall, University of Minnesota, Minneapolis, MN;Department of Information and Computing Sciences, University of Oklahoma, Norman, OK
Venue:
Journal of the ACM (JACM)
Year:
1976

Citing 8
Cited 179

Approximate Algorithms for the 0/1 Knapsack Problem

Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
The Complexity of Near-Optimal Graph Coloring

Journal of the ACM (JACM)
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Some simplified NP-complete problems

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing

Allocating Modules to Processors in a Distributed System

IEEE Transactions on Software Engineering
A parallel algorithm for the quadratic assignment problem

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Approximation and Intractability Results for the Maximum Cut Problem and Its Variants

IEEE Transactions on Computers
e-approximations with minimum packing constraint violation (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the approximation of maximum satisfiability

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
State assignment for hardwired VLSI control units

ACM Computing Surveys (CSUR)
.879-approximation algorithms for MAX CUT and MAX 2SAT

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximate solutions to problems in PSPACE

ACM SIGACT News
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Color image quantization by minimizing the maximum intercluster distance

ACM Transactions on Graphics (TOG)
An integrated framework for deterministic and stochastic optimization

Proceedings of the 29th conference on Winter simulation
The approximability of NP-hard problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
On the Applicability of Lower Bounds for Solving RectilinearQuadratic Assignment Problems in Parallel

Computational Optimization and Applications
Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering for VLSI Applications

IEEE Transactions on Computers
An improved approximation ratio for the minimum latency problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Polynomial-Time Aggregation of Integer Programming Problems

Journal of the ACM (JACM)
Towards a 4/3 approximation for the asymmetric traveling salesman problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Ant algorithms for discrete optimization

Artificial Life
Code Generation and Storage Allocation for Machines with Span-Dependent Instructions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Approximating min-sum k-clustering in metric spaces

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the landscape ruggedness of the quadratic assignment problem

Theoretical Computer Science
A Genetic/Tabu Thresholding Hybrid Algorithm for the ProcessAllocation Problem

Journal of Heuristics
On the Hardness of the Quadratic Assignment Problem with Metaheuristics

Journal of Heuristics
The Ant System Applied to the Quadratic Assignment Problem

IEEE Transactions on Knowledge and Data Engineering
Methods for binary multidimensional scaling

Neural Computation
Faster approximation algorithms for the minimum latency problem

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The k-traveling repairman problem

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Minimum Latency Problem Is NP-Hard for Weighted Trees

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Using Approximation Hardness to Achieve Dependable Computation

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Algorithms Based on Randomization and Linear and Semidefinite Programming

SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Selected topics on assignment problems

Discrete Applied Mathematics
Approximation schemes for clustering problems

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Complexity Of Computations

ACM '78 Proceedings of the 1978 annual conference
The complexity of design automation problems

DAC '80 Proceedings of the 17th Design Automation Conference
Evaluation of heuristic techniques for test vector ordering

Proceedings of the 14th ACM Great Lakes symposium on VLSI
Ant Colony Optimisation for Machine Layout Problems

Computational Optimization and Applications
Complexity of approximation algorithms for combinatorial problems: a survey

ACM SIGACT News
Improved Lower Bounds for the Quadratic Assignment Problem

Automation and Remote Control
Some Global Optimization Problems on Stiefel Manifolds

Journal of Global Optimization
Application of ant colony optimization for no-wait flowshop scheduling problem to minimize the total completion time

Computers and Industrial Engineering
A tabu search algorithm for the quadratic assignment problem

Computational Optimization and Applications
Evaluation of placer suboptimality via zero-change netlist transformations

Proceedings of the 2005 international symposium on Physical design
A divide-and-merge methodology for clustering

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The enhanced evolutionary tabu search and its application to the quadratic assignment problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A low-level hybridization between memetic algorithm and VNS for the max-cut problem

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics
Complexity of the directed spanning cactus problem

Discrete Applied Mathematics
A performance guarantee heuristic for electronic components placement problems including thermal effects

Computers and Operations Research
Confronting hardness using a hybrid approach

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A tabu search heuristic for the dynamic space allocation problem

Computers and Operations Research
A tale of two nets: studies of wirelength progression in physical design

Proceedings of the 2006 international workshop on System-level interconnect prediction
A fast hybrid genetic algorithm for the quadratic assignment problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Architecture-aware FPGA placement using metric embedding

Proceedings of the 43rd annual Design Automation Conference
For effective facilities planning: layout optimization then simulation, or vice versa?

WSC '05 Proceedings of the 37th conference on Winter simulation
Completeness in approximation classes beyond APX

Theoretical Computer Science
A divide-and-merge methodology for clustering

ACM Transactions on Database Systems (TODS)
The approximability of the weighted Hamiltonian path completion problem on a tree

Theoretical Computer Science
Approximating the k-traveling repairman problem with repairtimes

Journal of Discrete Algorithms
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views

Image and Vision Computing
The k-traveling repairmen problem

ACM Transactions on Algorithms (TALG)
Tours of Graphs, Digraphs, and Sequential Machines

IEEE Transactions on Computers
A plant location guide for the unsure

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Iterated fast local search algorithm for solving quadratic assignment problems

Robotics and Computer-Integrated Manufacturing
On greedy construction heuristics for the MAX-CUT problem

International Journal of Computational Science and Engineering
The on-line asymmetric traveling salesman problem

Journal of Discrete Algorithms
Approximation results for the weighted P4 partition problem

Journal of Discrete Algorithms
An optimal sdp algorithm for max-cut, and equally optimal long code tests

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Evaluation of the throughput of a multiple-picker order picking system with congestion consideration

Computers and Industrial Engineering
A Modified Simulated Annealing Algorithm for the Quadratic Assignment Problem

Informatica
The Directed Minimum Latency Problem

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH

Cybernetics and Systems
Second order cone programming relaxation for quadratic assignment problems

Optimization Methods & Software
A new formulation for the Traveling Deliveryman Problem

Discrete Applied Mathematics
On the maximum quadratic assignment problem

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Multiobjective Landscape Analysis and the Generalized Assignment Problem

Learning and Intelligent Optimization
Minimum-weight cycle covers and their approximability

Discrete Applied Mathematics
Matrix columns allocation problems

Theoretical Computer Science
Solving permutational routing problems by population-based metaheuristics

Computers and Industrial Engineering
Role and channel assignments for wireless mesh networks using hybrid approach

Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalability, generalization and coevolution -- experimental comparisons applied to automated facility layout planning

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Solving quadratic assignment problems by genetic algorithms with GPU computation: a case study

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Testing of Hybrid Genetic Algorithms for Structured Quadratic Assignment Problems

Informatica
Local search starting from an LP solution: Fast and quite good

Journal of Experimental Algorithmics (JEA)
Reoptimization of minimum and maximum traveling salesman's tours

Journal of Discrete Algorithms
A decentralised task mapping approach for homogeneous multiprocessor network-on-chips

International Journal of Reconfigurable Computing - Selected papers from ReCoSoc08
Approximating the minimum quadratic assignment problems

ACM Transactions on Algorithms (TALG)
Multistart tabu search and diversification strategies for the quadratic assignment problem

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
On the Maximum Quadratic Assignment Problem

Mathematics of Operations Research
A tabu search heuristic for the dynamic space allocation problem

Computers and Operations Research
Plateau connection structure and multiobjective metaheuristic performance

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Hierarchical Iterated Local Search for the Quadratic Assignment Problem

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Incorporating Tabu Search Principles into ACO Algorithms

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Complexity of the directed spanning cactus problem

Discrete Applied Mathematics
Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics
On topology reconfiguration for defect-tolerant NoC-based homogeneous manycore systems

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Knowledge Based Image Annotation Refinement

Journal of Signal Processing Systems
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems

Mathematics of Operations Research
The traveling salesman: computational solutions for TSP applications

The traveling salesman: computational solutions for TSP applications
Paper: Robust taboo search for the quadratic assignment problem

Parallel Computing
Differential approximation for some routing problems

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Instance generators and test suites for the multiobjective quadratic assignment problem

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Ruin and recreate principle based approach for the quadratic assignment problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Small space representations for metric min-sum k-clustering and their applications

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Effective formulation reductions for the quadratic assignment problem

Computers and Operations Research
Cunning ant system for quadratic assignment problem with local search and parallelization

PReMI'07 Proceedings of the 2nd international conference on Pattern recognition and machine intelligence
Control flow emulation on tiled SIMD architectures

CC'08/ETAPS'08 Proceedings of the Joint European Conferences on Theory and Practice of Software 17th international conference on Compiler construction
A robust iterative refinement clustering algorithm with smoothing search space

Knowledge-Based Systems
An absolute and fair QoS differentiation scheme for DWDM OBS networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Chemical-reaction-inspired metaheuristic for optimization

IEEE Transactions on Evolutionary Computation
Improving the scalability of data center networks with traffic-aware virtual machine placement

INFOCOM'10 Proceedings of the 29th conference on Information communications
Improved genetic algorithm for minimum latency problem

Proceedings of the 2010 Symposium on Information and Communication Technology
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A Fourier space algorithm for solving quadratic assignment problems

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?

Computational Geometry: Theory and Applications
Topology-aware wavelength partitioning for DWDM OBS networks: A novel approach for absolute QoS provisioning

Computer Networks: The International Journal of Computer and Telecommunications Networking
A3MAP: architecture-aware analytic mapping for networks-on-chip

Proceedings of the 2010 Asia and South Pacific Design Automation Conference
A simulated annealing algorithm for solving the bi-objective facility layout problem

Expert Systems with Applications: An International Journal
Self Controlling Tabu Search algorithm for the Quadratic Assignment Problem

Computers and Industrial Engineering
Structural properties of hard metric TSP inputs

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Coupling simulation with heuristiclab to solve facility layout problems

Winter Simulation Conference
Improved approximations for hard optimization problems via problem instance classification

Rainbow of computer science
Knowing all optimal solutions does not help for TSP reoptimization

Computation, cooperation, and life
An O(n4) Algorithm for the QAP Linearization Problem

Mathematics of Operations Research
An integrated synthetic value of fuzzy judgments and nonlinear programming methodology for ranking the facility layout patterns

Computers and Industrial Engineering
Reoptimization of minimum and maximum traveling salesman's tours

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
An artificial immune system based algorithm to solve unequal area facility layout problem

Expert Systems with Applications: An International Journal
Iterated ants: an experimental study for the quadratic assignment problem

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Overlaying multiple maps efficiently

CIT'04 Proceedings of the 7th international conference on Intelligent Information Technology
An efficient broadcast scheme for wireless data schedule under a new data affinity model

ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
A Benchmarking Model for Management of Knowledge-Intensive Service Delivery Networks

Journal of Management Information Systems
Radial search: a simple solution approach to hard combinatorial problems

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Two-Stage inter-cell layout design for cellular manufacturing by using ant colony optimization algorithms

ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Communication-aware processor allocation for supercomputers

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
The on-line asymmetric traveling salesman problem

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Approximation results for the weighted P4 partition problems

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
An improved approximation algorithm for TSP with distances one and two

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Variable neighborhood search with permutation distance for QAP

KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
Algorithmics – is there hope for a unified theory?

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Improved approximations for TSP with simple precedence constraints

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The capacitated max-k-cut problem

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Solving a group layout design model of a dynamic cellular manufacturing system with alternative process routings, lot splitting and flexible reconfiguration by simulated annealing

Computers and Operations Research
Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems

Computers and Operations Research
New linearizations of quadratic assignment problems

Computers and Operations Research
Survey: A survey on the structure of approximation classes

Computer Science Review
Selfish splittable flows and NP-completeness

Computer Science Review
Copositive and semidefinite relaxations of the quadratic assignment problem

Discrete Optimization
Approximation algorithm for minimizing total latency in machine scheduling with deliveries

Discrete Optimization
Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems

Discrete Optimization
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem

Discrete Optimization
Analysis of Christofides' heuristic: Some paths are more difficult than cycles

Operations Research Letters
Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times

Operations Research Letters
Guaranteed performance heuristics for the bottleneck travelling salesman problem

Operations Research Letters
Worst-case analysis of two travelling salesman heuristics

Operations Research Letters
Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems

Operations Research Letters
On local search for the generalized graph coloring problem

Operations Research Letters
NetDEO: automating network design, evolution, and optimization

Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
An implementation of the iterated tabu search algorithm for the quadratic assignment problem

OR Spectrum
How to park freight trains on rail---rail transshipment yards: the train location problem

OR Spectrum
Subset quadratic assignment problem

IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Intelligent design of a dynamic machine layout in uncertain environment of flexible manufacturing systems

Journal of Intelligent Manufacturing
Canonical dual approach to solving the maximum cut problem

Journal of Global Optimization
Improving communication latency with the write-only architecture

Journal of Parallel and Distributed Computing
The role of centrality in ambulance dispatching

Decision Support Systems
Finding social optima in congestion games with positive externalities

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A spanning tree-based encoding of the MAX CUT problem for evolutionary search

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Parallel partitioning for distributed systems using sequential assignment

Journal of Parallel and Distributed Computing
Clustering under approximation stability

Journal of the ACM (JACM)
Max-k-Cut by the Discrete Dynamic Convexized Method

INFORMS Journal on Computing
Hardness of approximation and integer programming frameworks for searching for caterpillar trees

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Variable-Order Ant System for VLSI multiobjective floorplanning

Applied Soft Computing
Improved approximations for TSP with simple precedence constraints

Journal of Discrete Algorithms
Application of a MAX-CUT Heuristic to the Contig Orientation Problem in Genome Assembly

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Communication and migration energy aware task mapping for reliable multiprocessor systems

Future Generation Computer Systems

Quantified Score

Hi-index	0.02

Visualization

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.