Approximation algorithm for the capacitated correlation clustering problem with penalties (Q2151358): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Min-max correlation clustering via multicut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering in data streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Bipartite Correlation Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with qualitative information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanism design for two-opposite-facility location games with penalties on distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Capacitated Clustering in Doubling Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On single-source capacitated facility location with cost and fairness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the fault-tolerant facility location problem with penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motif and Hypergraph Correlation Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant FPT approximation algorithm for hard-capacitated \(k\)-means / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search approximation algorithms for the \(k\)-means problem with penalties / rank
 
Normal rank

Latest revision as of 13:15, 29 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithm for the capacitated correlation clustering problem with penalties
scientific article

    Statements

    Approximation algorithm for the capacitated correlation clustering problem with penalties (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 July 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    correlation clustering
    0 references
    capacitated
    0 references
    penalties
    0 references
    approximation algorithm
    0 references
    LP-rounding
    0 references
    0 references