On a relaxed maximally disjoint path pair problem: a bicriteria approach (Q6069837)
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: On a relaxed maximally disjoint path pair problem: a bicriteria approach |
scientific article; zbMATH DE number 7767561
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a relaxed maximally disjoint path pair problem: a bicriteria approach |
scientific article; zbMATH DE number 7767561 |
Statements
On a relaxed maximally disjoint path pair problem: a bicriteria approach (English)
0 references
17 November 2023
0 references
bicriteria problems
0 references
pairs of paths
0 references
maximally disjoint labels
0 references
cost
0 references
0 references
