BALANCED PARTITION OF MINIMUM SPANNING TREES (Q4818586): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for the Geometric Covering Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Shifting Algorithm for Min-Max Tree Partitioning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation Algorithms for Min–Max Tree Partition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, <i>k</i>-MST, and Related Problems / rank | |||
Normal rank | |||
Revision as of 11:56, 7 June 2024
scientific article; zbMATH DE number 2104287
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | BALANCED PARTITION OF MINIMUM SPANNING TREES |
scientific article; zbMATH DE number 2104287 |
Statements
BALANCED PARTITION OF MINIMUM SPANNING TREES (English)
0 references
29 September 2004
0 references
approximation algorithms
0 references
computational geometry
0 references
