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, 1976Open Access

P-Complete Approximation Problems

Puntos clave

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.

Resumen

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.

Me gusta

Guardar

Ver artículo completo

Cite This Study

Sahni et al. (Thu,) studied this question.

synapsesocial.com/papers/69dd5dfe4917c2595e10161d https://doi.org/https://doi.org/10.1145/321958.321975

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

Me gusta

Guardar

Ver artículo completo