This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n17https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-srhttp://sr.dbpedia.org/resource/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-frhttp://fr.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Maximum_coverage_problem
rdf:type
yago:SocialGroup107950920 yago:Unit108189659 yago:WikicatSetFamilies yago:Family108078020 yago:YagoLegalActor yago:Abstraction100002137 yago:YagoLegalActorGeo yago:Group100031264 yago:YagoPermanentlyLocatedEntity yago:Organization108008335
rdfs:label
Problème de couverture maximale Maximum coverage problem
rdfs: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. the union of the selected sets has maximal size. Formally, (unweighted) Maximum Coverage En algorithmique, le problème de couverture maximale consiste à couvrir un nombre maximal d'éléments avec au plus k sous-ensembles mis à disposition. Ce problème algorithmique est NP-dur et il existe des algorithmes d'approximation pour le résoudre. C'est une variante du problème de couverture par ensembles.
dcterms:subject
dbc:Families_of_sets dbc:NP-complete_problems
dbo:wikiPageID
24221954
dbo:wikiPageRevisionID
1106927273
dbo:wikiPageWikiLink
dbr:Operations_research dbc:Families_of_sets dbr:Integer_linear_program dbr:NP-hard dbr:Junade_Ali dbc:NP-complete_problems dbr:Computational_complexity_theory dbr:Computer_science dbr:Set_cover_problem dbr:Greedy_algorithm dbr:Approximation_algorithms dbr:Submodular_set_function
owl:sameAs
dbpedia-fa:مسئله_پوشش_بیشینه dbpedia-fr:Problème_de_couverture_maximale dbpedia-sr:Problem_maksimalne_pokrivenosti n17:4s8DM yago-res:Maximum_coverage_problem wikidata:Q6795886 freebase:m.07k6tbl
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Cite_book
dbo:abstract
En algorithmique, le problème de couverture maximale consiste à couvrir un nombre maximal d'éléments avec au plus k sous-ensembles mis à disposition. Ce problème algorithmique est NP-dur et il existe des algorithmes d'approximation pour le résoudre. C'est une variante du problème de couverture par ensembles. 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 can 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.
prov:wasDerivedFrom
wikipedia-en:Maximum_coverage_problem?oldid=1106927273&ns=0
dbo:wikiPageLength
10646
foaf:isPrimaryTopicOf
wikipedia-en:Maximum_coverage_problem