Rejoinder on: ``Static and dynamic source locations in undirected networks'' (Q889103): Difference between revisions
From MaRDI portal
Created a new Item |
Changed label, description and/or aliases in en, and other parts |
||
| (4 intermediate revisions by 4 users not shown) | |||
| description / en | description / en | ||
scientific article | scientific article; zbMATH DE number 6505201 | ||
| Property / DOI | |||
| Property / DOI: 10.1007/s11750-015-0400-1 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11750-015-0400-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1872837856 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11750-015-0400-1 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:25, 10 July 2025
scientific article; zbMATH DE number 6505201
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rejoinder on: ``Static and dynamic source locations in undirected networks'' |
scientific article; zbMATH DE number 6505201 |
Statements
Rejoinder on: ``Static and dynamic source locations in undirected networks'' (English)
0 references
6 November 2015
0 references
source location problem
0 references
single cover problem
0 references
matroid
0 references
(dual) greedy algorithm
0 references
(minimal) deficient set
0 references
plural cover problem
0 references
tree network
0 references
linear algorithm
0 references
pseudo-polynomial algorithm
0 references
fully polynomial-time approximation scheme
0 references
dynamic flow
0 references
NP-hardness
0 references
static networks
0 references
