What question did this study set out to answer?

The research aims to explore the approximation complexity of P-complete problems and provide a solution for clustering.

July 1, 1976Journal of the ACMOpen Access

P-Complete Approximation Problems

View Full Paper

Ask AI

Bookmark

Authors

Demonstrates that approximation problems for P-complete problems are also P-complete, while proposing a linear time algorithm for clustering.

The research aims to explore the approximation complexity of P-complete problems and provide a solution for clustering.
Analyzing approximation problems for various P-complete cases such as traveling salesperson and integer programming.
Presenting a linear time approximation algorithm specifically for the clustering problem.
Confirmed that the approximation problems for P-complete problems are P-complete.
Developed a novel linear time approximation algorithm for clustering.

Sahni et al. (1976) studied this question.

View Full Paper

Ask AI

Bookmark

Demonstrates that approximation problems for P-complete problems are also P-complete, while proposing a linear time algorithm for clustering.