maximum independent set (optimization version)
GPTKB entity
Statements (29)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
gptkb:network_protocol
coding theory resource allocation scheduling |
| gptkbp:approximationRatio |
hard to approximate
|
| gptkbp:complement |
minimum vertex cover
|
| gptkbp:complexity |
gptkb:NP-hard
W[1]-complete |
| gptkbp:decisionProblemVersion |
independent set (decision version)
|
| gptkbp:estimatedCost |
yes
|
| gptkbp:famousAlgorithm |
greedy algorithm
branch and bound exact exponential time algorithms |
| https://www.w3.org/2000/01/rdf-schema#label |
maximum independent set (optimization version)
|
| gptkbp:inapproximability |
cannot be approximated within n^(1-epsilon) for any epsilon>0 unless P=NP
|
| gptkbp:input |
graph
|
| gptkbp:optimizedFor |
maximization
|
| gptkbp:output |
largest independent set
|
| gptkbp:relatedTo |
graph theory
independent set vertex cover NP-hard problem maximum independent set |
| gptkbp:studiedBy |
20th century
|
| gptkbp:usedIn |
combinatorial optimization
theoretical computer science |
| gptkbp:bfsParent |
gptkb:NP-hard_problems
|
| gptkbp:bfsLayer |
7
|