|
gptkbp:instanceOf
|
gptkb:Combinatorial_Optimization_Problem
gptkb:Mathematical_Problem
|
|
gptkbp:complexity
|
gptkb:NP-hard
|
|
gptkbp:firstDescribed
|
1971
|
|
gptkbp:formedBy
|
gptkb:Eugene_L._Lawler
|
|
gptkbp:generalizes
|
gptkb:Hitting_Set
gptkb:Vertex_Cover
|
|
gptkbp:hasApplication
|
gptkb:Machine_Learning
gptkb:Logistics
gptkb:Crew_Scheduling
gptkb:Facility_Location
gptkb:Sensor_Placement
Telecommunications
Biology
Scheduling
Data Mining
Resource Allocation
Network Design
|
|
gptkbp:input
|
gptkb:Universal_Set
Collection of Subsets
|
|
gptkbp:output
|
Subcollection Covering Universal Set
|
|
gptkbp:reduces
|
Number of Subsets Selected
|
|
gptkbp:relatedTo
|
gptkb:Set_Theory
gptkb:Set_Covering_Problem
|
|
gptkbp:solvedBy
|
gptkb:Approximation_Algorithm
gptkb:Greedy_Algorithm
gptkb:Integer_Programming
|
|
gptkbp:usedIn
|
gptkb:Mathematics
Computer Science
Operations Research
|
|
gptkbp:bfsParent
|
gptkb:Karp's_21_NP-complete_problems
gptkb:Reducibility_Among_Combinatorial_Problems_(Karp,_1972)
|
|
gptkbp:bfsLayer
|
6
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Set Covering
|