Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (Q2072077): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Analysis of agglomerative clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting an ordering into a partition to minimize diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Centrality of Trees for Capacitated k-Center / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Allocate Network Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum sum of radii and diameters clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Clustering better than Average-Linkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Clustering and Dynamic Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the sum of cluster diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hierarchical diameter-clustering and the supplier problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cost function for similarity-based hierarchical clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance guarantees for hierarchical clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for a complete link method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion Cluster Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708233 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple heuristic for the p-centre problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On metric clustering to minimize the sum of radii / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum sum of diameters clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum sum-of-splits clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of diameters efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy and hard bottleneck location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical clustering schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>K</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-center problems with minimum coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bottleneck problem with minimum quantity commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Digraph Connectivity Hastens Minimum Sum-of-Diameters Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weighted sum of split and diameter clustering / rank
 
Normal rank

Revision as of 21:05, 27 July 2024

scientific article
Language Label Description Also known as
English
Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
scientific article

    Statements

    Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (English)
    0 references
    0 references
    1 February 2022
    0 references
    approximation algorithms
    0 references
    clustering
    0 references
    combinatorial optimization
    0 references
    graph algorithms
    0 references
    0 references
    0 references

    Identifiers