Complexity results for weighted timed event graphs (Q429654)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6048235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity results for weighted timed event graphs |
scientific article; zbMATH DE number 6048235 |
Statements
Complexity results for weighted timed event graphs (English)
0 references
20 June 2012
0 references
weighted timed event graphs
0 references
throughput
0 references
buffer requirement
0 references
complexity
0 references
approximation algorithm
0 references
0 references
0 references
0.7745912075042725
0 references
0.7615072727203369
0 references
