BALANCED PARTITION OF MINIMUM SPANNING TREES (Q4818586): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195903001190 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2127317202 / rank
 
Normal rank

Latest revision as of 10:04, 30 July 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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references