This HTML5 document contains 87 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/
n18https://www.mi.fu-berlin.de/math/groups/discgeom/ziegler/Preprintfiles/
foafhttp://xmlns.com/foaf/0.1/
n6http://people.csail.mit.edu/nickh/
n21https://global.dbpedia.org/id/
n9https://archive.org/details/matroidapplicati0000unse/page/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n8https://parasol.tamu.edu/~welch/teaching/411.f08/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
dbpedia-ithttp://it.dbpedia.org/resource/
n23http://www.kurims.kyoto-u.ac.jp/~fujishig/
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#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/
dbpedia-jahttp://ja.dbpedia.org/resource/

Statements

Subject Item
dbr:Greedoid
rdf:type
yago:Organization108008335 yago:Family108078020 yago:Group100031264 yago:SocialGroup107950920 yago:Unit108189659 yago:WikicatSetFamilies yago:YagoLegalActor yago:YagoLegalActorGeo yago:YagoPermanentlyLocatedEntity yago:Abstraction100002137
rdfs:label
Greedoid グリードイド Greedoide
rdfs:comment
In combinatorics, a greedoid is a type of set system. It arises from the notion of the matroid, which was originally introduced by Whitney in 1935 to study planar graphs and was later used by Edmonds to characterize a class of optimization problems that can be solved by greedy algorithms. Around 1980, Korte and Lovász introduced the greedoid to further generalize this characterization of greedy algorithms; hence the name greedoid. Besides mathematical optimization, greedoids have also been connected to graph theory, language theory, order theory, and other areas of mathematics. グリードイド(greedoid)は、ある公理を満たす集合とそのべき集合の部分集合の組である。マトロイドとの一般化であり、マトロイド同様に貪欲法を考えることができる。 In combinatoria, un greedoide è un tipo di . Sorge dalla nozione di matroide, che è stata originariamente introdotta Whitney nel 1935 per lo studio di e in seguito usata da per caratterizzare una classe di problemi di ottimizzazione che può essere risolta mediante . Intorno al 1980, e Lovász introdussero il greedoide come ulteriore generalizzazione per questa caratteristica di algoritmi greedy; da qui il nome greedoide. A parte l', i greedoidi sono stati anche connessi alla teoria dei grafi, teoria dei linguaggi, teoria poset, and altre aree della matematica.
dcterms:subject
dbc:Families_of_sets dbc:Greedy_algorithms dbc:Combinatorial_optimization dbc:Order_theory
dbo:wikiPageID
666526
dbo:wikiPageRevisionID
1106927210
dbo:wikiPageWikiLink
dbr:Cryptomorphism dbc:Families_of_sets dbr:Antimatroid dbr:Areas_of_mathematics dbr:Graph_theory dbr:Bernhard_Korte dbr:Weighted_graph dbr:Well_defined dbc:Greedy_algorithms dbr:Combinatorics dbr:Polymatroid dbr:Graph_(discrete_mathematics) dbr:Order_theory dbr:Without_loss_of_generality dbr:Invertible_matrix dbr:Subset dbr:Simplicial_complex dbr:Finite_set dbr:SIAM_Journal_on_Discrete_Mathematics dbr:Gaussian_elimination dbr:American_Journal_of_Mathematics dbr:Prim's_algorithm dbr:Real_number dbr:Jack_Edmonds dbr:Graphic_matroid dbr:Directed_graph dbr:Kruskal's_algorithm dbr:Oxford_University_Press dbr:Hassler_Whitney dbc:Combinatorial_optimization dbr:Power_set dbr:Weight_function dbr:Empty_set dbr:Planar_graph dbr:Matrix_(mathematics) dbr:Matroid dbr:Greedy_algorithm dbr:Set_system dbr:Rooted_graph dbr:Springer-Verlag dbc:Order_theory dbr:Mathematical_optimization dbr:Minimum_spanning_tree dbr:László_Lovász
dbo:wikiPageExternalLink
n6:PhDThesis.pdf n8:greedy.pdf n9:284 n18:006PREPRINT.pdf%3F1397057423 n23:Book1a.html
owl:sameAs
freebase:m.0314mt wikidata:Q637575 yago-res:Greedoid n21:4opV8 dbpedia-ja:グリードイド dbpedia-it:Greedoide
dbp:wikiPageUsesTemplate
dbt:Citation dbt:Short_description dbt:Reflist
dbo:abstract
In combinatoria, un greedoide è un tipo di . Sorge dalla nozione di matroide, che è stata originariamente introdotta Whitney nel 1935 per lo studio di e in seguito usata da per caratterizzare una classe di problemi di ottimizzazione che può essere risolta mediante . Intorno al 1980, e Lovász introdussero il greedoide come ulteriore generalizzazione per questa caratteristica di algoritmi greedy; da qui il nome greedoide. A parte l', i greedoidi sono stati anche connessi alla teoria dei grafi, teoria dei linguaggi, teoria poset, and altre aree della matematica. グリードイド(greedoid)は、ある公理を満たす集合とそのべき集合の部分集合の組である。マトロイドとの一般化であり、マトロイド同様に貪欲法を考えることができる。 In combinatorics, a greedoid is a type of set system. It arises from the notion of the matroid, which was originally introduced by Whitney in 1935 to study planar graphs and was later used by Edmonds to characterize a class of optimization problems that can be solved by greedy algorithms. Around 1980, Korte and Lovász introduced the greedoid to further generalize this characterization of greedy algorithms; hence the name greedoid. Besides mathematical optimization, greedoids have also been connected to graph theory, language theory, order theory, and other areas of mathematics.
gold:hypernym
dbr:System
prov:wasDerivedFrom
wikipedia-en:Greedoid?oldid=1106927210&ns=0
dbo:wikiPageLength
11376
foaf:isPrimaryTopicOf
wikipedia-en:Greedoid