Approximation algorithms for min-sum \(p\)-clustering (Q1281390): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Printer graphics for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of a generalized matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms for the minimum cost assignment problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:58, 28 May 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for min-sum \(p\)-clustering
scientific article

    Statements

    Approximation algorithms for min-sum \(p\)-clustering (English)
    0 references
    0 references
    0 references
    22 March 1999
    0 references
    \(p\)-clustering
    0 references
    approximation algorithm
    0 references

    Identifiers