한국어
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
전체 기사
카테고리
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
당신은 쓰기
사용자
로그인
등록
비밀번호 복구
태그
언어 태그
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
태그 set-cover - 이것은 페이지 7 페이지입니다 - GeneraCodice
Is 'double max-$k$ vertex-cover' NP-hard?
https://www.generacodice.com/ko/articolo/1580511/is-double-max-k-vertex-cover-np-hard
np-hard
-
set-cover
-
algorithms
-
graphs
cs.stackexchange
Vertex cover algorithms for directed graphs?
https://www.generacodice.com/ko/articolo/1580446/vertex-cover-algorithms-for-directed-graphs
set-cover
-
greedy-algorithms
-
graphs
cs.stackexchange
Minimum number of shopping trips for a group of people to buy presents for each other
https://www.generacodice.com/ko/articolo/1579913/minimum-number-of-shopping-trips-for-a-group-of-people-to-buy-presents-for-each-other
set-cover
-
algorithms
-
graphs
cs.stackexchange
Is this variant of set cover NP-complete?
https://www.generacodice.com/ko/articolo/1579840/is-this-variant-of-set-cover-np-complete
np-complete
-
set-cover
cs.stackexchange
Given a set C of set P of sets R, find the smallest set S such that at least one subset R from each P is a subset of S
https://www.generacodice.com/ko/articolo/1578083/given-a-set-c-of-set-p-of-sets-r-find-the-smallest-set-s-such-that-at-least-one-subset-r-from-each-p-is-a-subset-of-s
set-cover
-
algorithms
cs.stackexchange
Is the exact cover problem NP-hard when there is a restriction on the size?
https://www.generacodice.com/ko/articolo/1577880/is-the-exact-cover-problem-np-hard-when-there-is-a-restriction-on-the-size
np-hard
-
set-cover
cs.stackexchange
Growing a set given constraints
https://www.generacodice.com/ko/articolo/1576407/growing-a-set-given-constraints
optimization
-
discrete-mathematics
-
set-cover
cs.stackexchange
Clarification on the inapproximability of set cover
https://www.generacodice.com/ko/articolo/1571052/clarification-on-the-inapproximability-of-set-cover
approximation
-
set-cover
cs.stackexchange
NP-hardness of maximum set cover with even/odd coverage requirement
https://www.generacodice.com/ko/articolo/1570851/np-hardness-of-maximum-set-cover-with-even-odd-coverage-requirement
optimization
-
discrete-mathematics
-
np-hard
-
np
-
set-cover
cs.stackexchange
Is this a proof that SET COVER is not an NP-hard problem?
https://www.generacodice.com/ko/articolo/1567519/is-this-a-proof-that-set-cover-is-not-an-np-hard-problem
complexity-theory
-
approximation
-
np-hard
-
set-cover
-
graphs
cs.stackexchange
«
4
5
6
7
8
9
»
결과가 발견되었습니다: 105