Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587)
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: Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector |
scientific article; zbMATH DE number 6818687
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector |
scientific article; zbMATH DE number 6818687 |
Statements
Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (English)
0 references
14 December 2017
0 references
max + sum spanning tree problem
0 references
inverse optimization problem
0 references
Hamming distance
0 references
\(l_0\) norm
0 references
approximability
0 references
0 references
0 references
0 references
0 references
0 references
