Collision-free routing problem with restricted L-path (Q1670977)
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 6932689
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Collision-free routing problem with restricted L-path |
scientific article; zbMATH DE number 6932689 |
Statements
Collision-Free Routing problem with Restricted L-Path (English)
0 references
6 September 2018
0 references
maximum independent set
0 references
L-graphs
0 references
approximation algorithm
0 references
collision-free
0 references
co-comparable graph
0 references
0.9451623558998108
0 references
0.7359774708747864
0 references
0.7327715754508972
0 references
0.7192739248275757
0 references
0.7172735929489136
0 references
