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.
| Attributes | Values |
|---|
| rdf:type
| |
| rdfs:label
| - Greedoid (en)
- Greedoide (it)
- グリードイド (ja)
|
| 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. (en)
- グリードイド(greedoid)は、ある公理を満たす集合とそのべき集合の部分集合の組である。マトロイドとの一般化であり、マトロイド同様に貪欲法を考えることができる。 (ja)
- 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. (it)
|
| dcterms:subject
| |
| Wikipage page ID
| |
| Wikipage revision ID
| |
| Link from a Wikipage to another Wikipage
| |
| Link from a Wikipage to an external page
| |
| sameAs
| |
| dbp:wikiPageUsesTemplate
| |
| has abstract
| - 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. (en)
- グリードイド(greedoid)は、ある公理を満たす集合とそのべき集合の部分集合の組である。マトロイドとの一般化であり、マトロイド同様に貪欲法を考えることができる。 (ja)
- 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. (it)
|
| gold:hypernym
| |
| prov:wasDerivedFrom
| |
| page length (characters) of wiki page
| |
| foaf:isPrimaryTopicOf
| |
| is Link from a Wikipage to another Wikipage
of | |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)