A unified framework of FPT approximation algorithms for clustering problems (Q6065394): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
A unified framework of FPT approximation algorithms for clustering problems
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/lipics.isaac.2020.5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3113496837 / rank
 
Normal rank
Property / title
 
A unified framework of FPT approximation algorithms for clustering problems (English)
Property / title: A unified framework of FPT approximation algorithms for clustering problems (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Factor FPT Approximation for Capacitated k-Median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Data Placement Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the constrained \(k\)-means problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-Factor Approximation Algorithms for Hard Capacitated <i>k</i>-Median Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation for <i>k</i> -Median and Positive Correlation in Budgeted Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for the \(k\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Coresets for <i>k</i>-Median and <i>k</i>-Means Clustering in Metric and Euclidean Spaces and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Framework for Clustering Constrained Data without Locality Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved PTAS for the constrained \(k\)-means problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Strikes Back: Improved Facility Location Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant factor approximation for lower-bounded \(k\)-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Norms and All-L_p-Norms Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant Factor Approximation Algorithm for Fault-Tolerant <i>k</i> -Median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Priority k-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time approximation schemes for clustering problems in any dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating $k$-Median via Pseudo-Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-bounded facility location / rank
 
Normal rank

Latest revision as of 14:43, 3 August 2024

scientific article; zbMATH DE number 7765363
Language Label Description Also known as
English
A unified framework of FPT approximation algorithms for clustering problems
scientific article; zbMATH DE number 7765363

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    14 November 2023
    0 references
    clustering
    0 references
    approximation algorithms
    0 references
    fixed-parameter tractability
    0 references
    A unified framework of FPT approximation algorithms for clustering problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers