On the cost of essentially fair clusterings (Q5875470): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
label / enlabel / en
 
On the cost of essentially fair clusterings
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.APPROX-RANDOM.2019.18 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2978980326 / rank
 
Normal rank
Property / title
 
On the cost of essentially fair clusterings (English)
Property / title: On the cost of essentially fair clusterings (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for hard capacitated \(k\)-facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-approximation algorithm for the facility location problem with uniform capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving anonymity via clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Guarantees for Lower-Bounded Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-Based Algorithms for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5368726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 5-Approximation for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Allocate Network Centers / 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: Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Factor Approximation for Capacitated k-Center with Outliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness through awareness / 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: Greedy Strikes Back: Improved Facility Location Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy and hard bottleneck location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedy approach for facility location problems / 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: Constant approximation for k-median and k-means with outliers via iterative rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved and simplified inapproximability for \(k\)-means / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with Diversity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1.488 approximation algorithm for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating capacitated <i>k</i>-median with (1 + ∊)<i>k</i> open facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Uniform Capacitated <i>k</i> -Median Beyond the Natural LP Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating $k$-Median via Pseudo-Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5002778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair coresets and streaming algorithms for fair \(k\)-means / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-bounded facility location / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.APPROX-RANDOM.2019.18 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:43, 30 December 2024

scientific article; zbMATH DE number 7650085
Language Label Description Also known as
English
On the cost of essentially fair clusterings
scientific article; zbMATH DE number 7650085

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3 February 2023
    0 references
    approximation
    0 references
    clustering
    0 references
    fairness
    0 references
    LP rounding
    0 references
    On the cost of essentially fair clusterings (English)
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers