Set cover problem NP completeness
I have a quick question about Set cover problem. In Wikipedia, < https://en.wikipedia.org/wiki/Set_cover_problem >, they are saying "The decision version of set covering is NP-complete, and the optimization/search version of set cover is NP-hard". What is the decision version and what is the optimization version? I am really confused here. I used to learn that set cover is an NP-hard problem. Many thanks!
optimization np-complete
add a comment |
I have a quick question about Set cover problem. In Wikipedia, < https://en.wikipedia.org/wiki/Set_cover_problem >, they are saying "The decision version of set covering is NP-complete, and the optimization/search version of set cover is NP-hard". What is the decision version and what is the optimization version? I am really confused here. I used to learn that set cover is an NP-hard problem. Many thanks!
optimization np-complete
1
The page you cite explains this in detail in the fourth paragraph, starting "More formally ... ." Can you explain what part of that paragraph is giving you difficulty?
– saulspatz
Dec 1 at 4:19
This CS Stack reference question might be of use to you. cs.stackexchange.com/questions/9556/…
– Kyle Jones
Dec 1 at 6:38
add a comment |
I have a quick question about Set cover problem. In Wikipedia, < https://en.wikipedia.org/wiki/Set_cover_problem >, they are saying "The decision version of set covering is NP-complete, and the optimization/search version of set cover is NP-hard". What is the decision version and what is the optimization version? I am really confused here. I used to learn that set cover is an NP-hard problem. Many thanks!
optimization np-complete
I have a quick question about Set cover problem. In Wikipedia, < https://en.wikipedia.org/wiki/Set_cover_problem >, they are saying "The decision version of set covering is NP-complete, and the optimization/search version of set cover is NP-hard". What is the decision version and what is the optimization version? I am really confused here. I used to learn that set cover is an NP-hard problem. Many thanks!
optimization np-complete
optimization np-complete
asked Dec 1 at 4:03
Cheesecakeball
32
32
1
The page you cite explains this in detail in the fourth paragraph, starting "More formally ... ." Can you explain what part of that paragraph is giving you difficulty?
– saulspatz
Dec 1 at 4:19
This CS Stack reference question might be of use to you. cs.stackexchange.com/questions/9556/…
– Kyle Jones
Dec 1 at 6:38
add a comment |
1
The page you cite explains this in detail in the fourth paragraph, starting "More formally ... ." Can you explain what part of that paragraph is giving you difficulty?
– saulspatz
Dec 1 at 4:19
This CS Stack reference question might be of use to you. cs.stackexchange.com/questions/9556/…
– Kyle Jones
Dec 1 at 6:38
1
1
The page you cite explains this in detail in the fourth paragraph, starting "More formally ... ." Can you explain what part of that paragraph is giving you difficulty?
– saulspatz
Dec 1 at 4:19
The page you cite explains this in detail in the fourth paragraph, starting "More formally ... ." Can you explain what part of that paragraph is giving you difficulty?
– saulspatz
Dec 1 at 4:19
This CS Stack reference question might be of use to you. cs.stackexchange.com/questions/9556/…
– Kyle Jones
Dec 1 at 6:38
This CS Stack reference question might be of use to you. cs.stackexchange.com/questions/9556/…
– Kyle Jones
Dec 1 at 6:38
add a comment |
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3020971%2fset-cover-problem-np-completeness%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3020971%2fset-cover-problem-np-completeness%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
The page you cite explains this in detail in the fourth paragraph, starting "More formally ... ." Can you explain what part of that paragraph is giving you difficulty?
– saulspatz
Dec 1 at 4:19
This CS Stack reference question might be of use to you. cs.stackexchange.com/questions/9556/…
– Kyle Jones
Dec 1 at 6:38