Answers are grounded in this paper and cite their sources.
Demonstrates that approximation problems for P-complete problems are also P-complete, while proposing a linear time algorithm for clustering.
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.
No takes yet. Share an insight, caveat, or question.
Sahni et al. (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: