Clustering with or without the approximation (Q2377383): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-011-9382-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089472739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601533 / 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: A constant-factor approximation algorithm for the \(k\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Center-based clustering under perturbation stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Agnostic Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on solving large p-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Combinatorial Algorithms for Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / 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: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank

Latest revision as of 15:00, 6 July 2024

scientific article
Language Label Description Also known as
English
Clustering with or without the approximation
scientific article

    Statements

    Clustering with or without the approximation (English)
    0 references
    0 references
    0 references
    0 references
    28 June 2013
    0 references
    clustering
    0 references
    \(k\)-median
    0 references
    algorithms
    0 references
    approximation
    0 references
    0 references
    0 references
    0 references

    Identifiers