A preemptive algorithm for maximizing disjoint paths on trees (Q970615)
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 5709225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A preemptive algorithm for maximizing disjoint paths on trees |
scientific article; zbMATH DE number 5709225 |
Statements
A preemptive algorithm for maximizing disjoint paths on trees (English)
0 references
19 May 2010
0 references
online algorithms
0 references
disjoint paths
0 references
disjoint paths on trees
0 references
admission control
0 references
call control
0 references
0 references
0.9937687516212464
0 references
0.8563182353973389
0 references
