	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
Low	This article has been rated as Low-priority on the project's priority scale.

Computer science

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Reduction argument flawed[edit]

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)[reply]

Duplicate entry?[edit]

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)[reply]

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)[reply]

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

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

@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)[reply]

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)[reply]

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.