Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Maximum_coverage_problem> ?p ?o. }
Showing items 1 to 24 of
24
with 100 items per page.
- Maximum_coverage_problem abstract "The maximum coverage problem is a classical question in computer science, computational complexity theory, and operations research.It is a problem that is widely taught in approximation algorithms.As input you are given several sets and a number . The sets may have some elements in common. You must select at most of these sets such that the maximum number of elements are covered, i.e. the union of the selected sets has maximal size.Formally, (unweighted) Maximum Coverage Instance: A number and a collection of sets . Objective: Find a subset of sets, such that and the number of covered elements is maximized.The maximum coverage problem is NP-hard, and cannot be approximated within under standard assumptions. This result essentially matches the approximation ratio achieved by the generic greedy algorithm used for maximization of submodular functions with a cardinality constraint.".
- Maximum_coverage_problem wikiPageID "24221954".
- Maximum_coverage_problem wikiPageRevisionID "595175424".
- Maximum_coverage_problem hasPhotoCollection Maximum_coverage_problem.
- Maximum_coverage_problem subject Category:NP-complete_problems.
- Maximum_coverage_problem subject Category:Set_families.
- Maximum_coverage_problem type Abstraction100002137.
- Maximum_coverage_problem type Family108078020.
- Maximum_coverage_problem type Group100031264.
- Maximum_coverage_problem type Organization108008335.
- Maximum_coverage_problem type SetFamilies.
- Maximum_coverage_problem type SocialGroup107950920.
- Maximum_coverage_problem type Unit108189659.
- Maximum_coverage_problem type YagoLegalActor.
- Maximum_coverage_problem type YagoLegalActorGeo.
- Maximum_coverage_problem type YagoPermanentlyLocatedEntity.
- Maximum_coverage_problem comment "The maximum coverage problem is a classical question in computer science, computational complexity theory, and operations research.It is a problem that is widely taught in approximation algorithms.As input you are given several sets and a number . The sets may have some elements in common. You must select at most of these sets such that the maximum number of elements are covered, i.e.".
- Maximum_coverage_problem label "Maximum coverage problem".
- Maximum_coverage_problem sameAs m.07k6tbl.
- Maximum_coverage_problem sameAs Q6795886.
- Maximum_coverage_problem sameAs Q6795886.
- Maximum_coverage_problem sameAs Maximum_coverage_problem.
- Maximum_coverage_problem wasDerivedFrom Maximum_coverage_problem?oldid=595175424.
- Maximum_coverage_problem isPrimaryTopicOf Maximum_coverage_problem.