Talk:Metric k-center

Reduction argument flawed

The argumentation in the section on computational complexity is flawed since reducing a problem on to an NP-hard problem does not mean anything for the complexity of the original problem, in other words one can use an NP-hard problem to solve even very easy problems. The argumentation should be built the other way around, showing how to do a reduction of dominating set to k-center. Tomash (talk) 14:57, 21 February 2013 (UTC)

Duplicate entry?

The following discussion is closed. Please do not modify it. Subsequent comments should be made in a new section. A summary of the conclusions reached follows.

To merge the newer article Vertex k-center problem to the existing page Metric k-center as the topics are the same or similar. Klbrain (talk) 15:46, 13 November 2023 (UTC)

---

Isn't this problem the same as the one presented in the article Vertex k-center problem? AmirOnWiki (talk) 13:17, 9 September 2021 (UTC)

I agree. This article exists twice! Astenosfear (talk) 15:06, 1 February 2023 (UTC)

I propose to merge the two articles Astenosfear (talk) 15:21, 1 February 2023 (UTC)

@AmirOnWiki and Astenosfear: there have been no objection, so proceding would be fine. The key issue for me is that its not clear which direction to merge in; no direction has been proposed, both are similarly referenced; Metric k-center is the significantly older article (2009 rather than 2018), so might be the preferred target on those grounds; its also the one linked to similar articles on the other-language wikis. Klbrain (talk) 14:31, 25 October 2023 (UTC)

I agree that the older article should be the one used. It also uses the more common name (Metric k-Center) for the problem. 143.167.102.118 (talk) 11:37, 6 November 2023 (UTC)

The discussion above is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.