A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937)
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 7346750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint |
scientific article; zbMATH DE number 7346750 |
Statements
A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (English)
0 references
10 May 2021
0 references
location problem
0 references
maxian problem
0 references
tree
0 references
convex
0 references
0 references
0 references
0.8081989288330078
0 references
0.8081989288330078
0 references
0.792926549911499
0 references
0.7906090021133423
0 references
0.7871361374855042
0 references
