Fast coupled path planning: from pseudo-polynomial to polynomial (Q3578342)
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: Fast coupled path planning: from pseudo-polynomial to polynomial |
scientific article; zbMATH DE number 5758160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast coupled path planning: from pseudo-polynomial to polynomial |
scientific article; zbMATH DE number 5758160 |
Statements
Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial (English)
0 references
20 July 2010
0 references
coupled path planning
0 references
IMRT
0 references
submodularity
0 references
L\(^{\natural}\)-convexity
0 references
0.8175438642501831
0 references
0.7190021872520447
0 references
0.7160614132881165
0 references
0.7074818015098572
0 references
