Approximation Algorithms for Min–Max Tree Partition (Q4360130): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users 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.1006/jagm.1996.0848 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060460330 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:17, 20 March 2024
scientific article; zbMATH DE number 1077001
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for Min–Max Tree Partition |
scientific article; zbMATH DE number 1077001 |
Statements
Approximation Algorithms for Min–Max Tree Partition (English)
0 references
16 December 1997
0 references
min-max tree partition problem
0 references
