Simple greedy algorithms for fundamental multidimensional graph problems (Q5111457)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simple greedy algorithms for fundamental multidimensional graph problems |
scientific article; zbMATH DE number 7204577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simple greedy algorithms for fundamental multidimensional graph problems |
scientific article; zbMATH DE number 7204577 |
Statements
27 May 2020
0 references
multidimensional graph problems
0 references
matroids
0 references
shortest paths
0 references
Steiner trees
0 references
arborescences
0 references
Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems (English)
0 references
0.7472731471061707
0 references
0.7450893521308899
0 references
0.7450331449508667
0 references
0.7436474561691284
0 references
