Approximation Algorithm for Sparsest <i>k</i>-Partitioning (Q5384054): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2490668581 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1306.4384 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:41, 20 April 2024
scientific article; zbMATH DE number 7069410
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithm for Sparsest <i>k</i>-Partitioning |
scientific article; zbMATH DE number 7069410 |
Statements
Approximation Algorithm for Sparsest <i>k</i>-Partitioning (English)
0 references
20 June 2019
0 references
