The Weighted Sparsity Problem: Complexity and Algorithms (Q5285937): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0406005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1965933856 / rank | |||
Normal rank | |||
Latest revision as of 14:26, 19 March 2024
scientific article; zbMATH DE number 223188
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Weighted Sparsity Problem: Complexity and Algorithms |
scientific article; zbMATH DE number 223188 |
Statements
The Weighted Sparsity Problem: Complexity and Algorithms (English)
0 references
29 June 1993
0 references
computational complexity
0 references
sparse matrices
0 references
bipartite matching
0 references
NP-hard
0 references
Polynomial algorithms
0 references
