Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (Q924129): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.006 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2129343799 / rank | |||
Normal rank | |||
Revision as of 09:36, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse min-max spanning tree problem under the weighted sum-type Hamming distance |
scientific article |
Statements
Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (English)
0 references
28 May 2008
0 references
min-max spanning tree
0 references
inverse problem
0 references
Hamming distance
0 references
strongly polynomial algorithms
0 references
