Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Covering_problems> ?p ?o }
Showing triples 1 to 46 of
46
with 100 triples per page.
- Covering_problems abstract "In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that.Covering problems are minimization problems and usually linear programs, whose dual problems are called packing problems.The most prominent examples of covering problems are the set cover problem, which is equivalent to the hitting set problem, and its special cases, the vertex cover problem and the edge cover problem.".
- Covering_problems wikiPageExternalLink packing.html.
- Covering_problems wikiPageID "1045640".
- Covering_problems wikiPageLength "3125".
- Covering_problems wikiPageOutDegree "20".
- Covering_problems wikiPageRevisionID "612758978".
- Covering_problems wikiPageWikiLink Bipartite_dimension.
- Covering_problems wikiPageWikiLink Category:Combinatorics.
- Covering_problems wikiPageWikiLink Category:Computational_problems.
- Covering_problems wikiPageWikiLink Category:Mathematical_problems.
- Covering_problems wikiPageWikiLink Combinatorics.
- Covering_problems wikiPageWikiLink Complete_bipartite_graph.
- Covering_problems wikiPageWikiLink Computer_science.
- Covering_problems wikiPageWikiLink Disk_covering_problem.
- Covering_problems wikiPageWikiLink Duality_(optimization).
- Covering_problems wikiPageWikiLink Edge_cover.
- Covering_problems wikiPageWikiLink Linear_programming.
- Covering_problems wikiPageWikiLink Mathematical_optimization.
- Covering_problems wikiPageWikiLink Packing_problems.
- Covering_problems wikiPageWikiLink Petri_net.
- Covering_problems wikiPageWikiLink Polygon_covering.
- Covering_problems wikiPageWikiLink Set_cover_problem.
- Covering_problems wikiPageWikiLink Vertex_cover.
- Covering_problems wikiPageWikiLinkText "Covering problems".
- Covering_problems wikiPageWikiLinkText "covering problem".
- Covering_problems wikiPageWikiLinkText "covering problems".
- Covering_problems wikiPageWikiLinkText "covering".
- Covering_problems wikiPageUsesTemplate Template:Cite_book.
- Covering_problems wikiPageUsesTemplate Template:Covering-Packing_Problem_Pairs.
- Covering_problems wikiPageUsesTemplate Template:Reflist.
- Covering_problems subject Category:Combinatorics.
- Covering_problems subject Category:Computational_problems.
- Covering_problems subject Category:Mathematical_problems.
- Covering_problems hypernym Problems.
- Covering_problems type Disease.
- Covering_problems type Combinatoric.
- Covering_problems type Field.
- Covering_problems type Redirect.
- Covering_problems comment "In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that.Covering problems are minimization problems and usually linear programs, whose dual problems are called packing problems.The most prominent examples of covering problems are the set cover problem, which is equivalent to the hitting set problem, and its special cases, the vertex cover problem and the edge cover problem.".
- Covering_problems label "Covering problems".
- Covering_problems sameAs Q5179260.
- Covering_problems sameAs Problema_del_recobriment.
- Covering_problems sameAs m.0416pk.
- Covering_problems sameAs Q5179260.
- Covering_problems wasDerivedFrom Covering_problems?oldid=612758978.
- Covering_problems isPrimaryTopicOf Covering_problems.