Finding paths with minimum shared edges (Q386426): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6236739 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimum shared edges problem | |||
Property / zbMATH Keywords: minimum shared edges problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximation algorithm | |||
Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
inapproximability | |||
Property / zbMATH Keywords: inapproximability / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
heuristic algorithms | |||
Property / zbMATH Keywords: heuristic algorithms / rank | |||
Normal rank |
Revision as of 12:59, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding paths with minimum shared edges |
scientific article |
Statements
Finding paths with minimum shared edges (English)
0 references
9 December 2013
0 references
minimum shared edges problem
0 references
approximation algorithm
0 references
inapproximability
0 references
heuristic algorithms
0 references