Paper Citation Record · LEDGER

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering

As of 20 August 2026, this Paper Citation Record lists 54 of 54 outbound references and 1 inbound Pith citation observation for arXiv:2504.14683.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2504.14683 v2

Coverage vector

measured 54 of 54 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-16T11:54:16.450669Z

measured 55 of 55 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T00:47:34.089974Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-07T00:47:34.128097Z

Reference resolution

54 of 54 outbound references displayed

verified exact4
verified fuzzy37
unresolved11
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e2a64135-7fdc-409f-a0d9-ab0b1d1ed81d · outbound

This paper cites Chen, Allen Liu, Sandeep Silwal, Pattara Sukprasert, Ali Vakil- ian, and Fred Zhang.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Chen, Allen Liu, Sandeep Silwal, Pattara Sukprasert, Ali Vakil- ian, and Fred Zhang

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.171564Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 05d82380-fba5-4979-9ba8-35adbf544460 · outbound

This paper cites Fair clustering via equi- table group representations.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Fair clustering via equi- table group representations

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.158286Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 6a5daa9e-6449-4afd-85f4-2ac649a24aec · outbound

This paper cites Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers

Reference 3

Resolution: verified exact; doi, observed 2026-08-16T11:54:17.144427Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 3d0504d4-6439-49af-bc6f-2753f0fbda38 · outbound

This paper cites A technique for obtaining true approximations for k-center with covering constraints.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering A technique for obtaining true approximations for k-center with covering constraints

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.129794Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation bd0629fe-7d5e-43e8-aee1-8563b2c187a2 · outbound

This paper cites Local search heuristics for k-median and facility location problems.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Local search heuristics for k-median and facility location problems

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.115062Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 31a5e8b1-6d03-4db3-b5d5-04a597d0dca9 · outbound

This paper cites Scalable fair clustering.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Scalable fair clustering

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.100137Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation b1000775-fb0f-4bbe-b8da-e158c17aac86 · outbound

This paper cites A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-16T11:54:16.250905Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56d615f0-5fc3-4dff-a647-4cba058f632e · outbound

This paper cites A constant approximation for colorfulk-center.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering A constant approximation for colorfulk-center

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.086289Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation dc6a1fb9-e3b7-487f-8371-19546eb23a9f · outbound

This paper cites FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering FPT constant-approximations for capacitated clustering to minimize the sum of cluster radii

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.072619Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation f5f60519-7bf6-4dac-b92e-4ba65dec8eda · outbound

This paper cites Varadarajan.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Varadarajan

Reference 10

Resolution: malformed identifier; no resolver link, observed 2026-08-16T11:54:16.264256Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c25caa0f-7bde-49c1-8e01-e078610b6ae8 · outbound

This paper cites Novel properties of hierar- chical probabilistic partitions and their algorithmic applications.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Novel properties of hierar- chical probabilistic partitions and their algorithmic applications

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.059767Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 5db5c995-7396-4587-bbbc-a2dcf8e1937e · outbound

This paper cites Improved fixed-parameter bounds for min-sum-radii and diameters k-clustering and their fair variants.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Improved fixed-parameter bounds for min-sum-radii and diameters k-clustering and their fair variants

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.046985Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 9eec356c-249e-4df7-b11f-dd4f3ccb7c02 · outbound

This paper cites Salavatipour.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Salavatipour

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-16T11:54:16.276680Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7988cd0-8805-471f-b1e0-f3edb055155c · outbound

This paper cites Fair algorithms for clustering.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Fair algorithms for clustering

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.034024Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d673321f-2cd6-4c7d-9edd-1fc22278e151 · outbound

This paper cites On the cost of essentially fair clusterings.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering On the cost of essentially fair clusterings

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.021052Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation e178091d-4071-4810-917c-b30936128ad7 · outbound

This paper cites Fair Clustering with Multiple Colors.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Fair Clustering with Multiple Colors

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-16T11:54:16.289090Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f390b9f2-0f73-403e-8939-8982fcb55423 · outbound

This paper cites Fairness, semi- supervised learning, and more: A general framework for clustering with stochastic pairwise constraints.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Fairness, semi- supervised learning, and more: A general framework for clustering with stochastic pairwise constraints

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:17.007413Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 748fba34-623c-4bfa-be78-902208e1e5ab · outbound

This paper cites A (3 + ϵ)- approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering A (3 + ϵ)- approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.993954Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation ac9b44a2-5230-4e23-beb0-470ab4a27b26 · outbound

This paper cites FPT Ap- proximations for Fairk-Min-Sum-Radii.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering FPT Ap- proximations for Fairk-Min-Sum-Radii

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-16T11:54:16.301954Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a751d630-3156-4d9f-971a-e1682106e83c · outbound

This paper cites Clustering to minimize the sum of cluster diameters.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Clustering to minimize the sum of cluster diameters

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-16T11:54:16.306371Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02a9d881-271c-4fba-a7a1-4d01255be1b7 · outbound

This paper cites Matroid and knapsack center problems.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Matroid and knapsack center problems

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.980856Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation a5d13732-a258-43a1-bd5f-30d102320139 · outbound

This paper cites Parameterized approximation algorithms for sum of radii clustering and variants.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Parameterized approximation algorithms for sum of radii clustering and variants

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.967319Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation f6a8fdb7-82bd-41fd-84f4-427776275f90 · outbound

This paper cites Proportionally fair clustering.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Proportionally fair clustering

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.954255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation a5694255-b864-4792-a0dc-59ac59bd03c7 · outbound

This paper cites Fair clustering through fairlets.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Fair clustering through fairlets

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.939451Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 7d3d1f16-acfa-4ed2-9111-0792d0ee4f63 · outbound

This paper cites How to solve fair k-center in massive data models.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering How to solve fair k-center in massive data models

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.924679Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 0a4262e2-f994-48c0-93d3-4f0c5af1b728 · outbound

This paper cites Approximating fair clustering with cascaded norm objectives.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Approximating fair clustering with cascaded norm objectives

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.910135Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d994fca3-32ed-4699-aed3-8943acdcea0c · outbound

This paper cites Fair representation clustering with several protected classes.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Fair representation clustering with several protected classes

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.896651Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d87bde2f-7d50-4302-b929-30ca2fcb0243 · outbound

This paper cites Marathe, S.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Marathe, S

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.882738Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation ad8a0a95-fba0-4ba8-be2c-6ecc8359d0d1 · outbound

This paper cites Ap- proximating fair k-min-sum-radii in euclidean space.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Ap- proximating fair k-min-sum-radii in euclidean space

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.869008Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation a6bf5bb5-9e25-4092-a989-6584af036d01 · outbound

This paper cites FPT approximations for Capacitated Sum of Radii and Diameters.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering FPT approximations for Capacitated Sum of Radii and Diameters

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-16T11:54:16.347655Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15c56f80-4373-4d4f-9c63-da10f6e00fb2 · outbound

This paper cites Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Improved Polynomial-Time Approximations for Clustering with Minimum Sum of Radii or Diameters

Reference 31

Resolution: malformed identifier; no resolver link, observed 2026-08-16T11:54:16.352103Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2145d503-28b5-4953-babe-f2bad0ba95d9 · outbound

This paper cites An efficient reduction technique for degree-constrained subgraph and bidi- rected network flow problems.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering An efficient reduction technique for degree-constrained subgraph and bidi- rected network flow problems

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.845727Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation b5008a98-07f0-49d5-9df1-29dd2514e347 · outbound

This paper cites an unresolved cited work.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Unresolved cited work

Reference 33

Resolution: unresolved; raw_fallback, observed 2026-08-16T11:54:16.832717Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation e69d1fb8-3c93-4eb0-b35e-417def3488f9 · outbound

This paper cites Constant-Factor Approximation Algorithms for Socially Fair $k$-Clustering.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Constant-Factor Approximation Algorithms for Socially Fair $k$-Clustering

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-16T11:54:16.364678Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2e5370d5-f78d-4d55-9729-157e09670780 · outbound

This paper cites Pirwani, and Kasturi R.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Pirwani, and Kasturi R

Reference 35

Resolution: verified exact; doi, observed 2026-08-16T11:54:16.527239Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 058e392d-6234-4729-a384-107a818cecfd · outbound

This paper cites Pirwani, and Kasturi R.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Pirwani, and Kasturi R

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-16T11:54:16.374130Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d839c04c-74e6-4434-a82f-4b45c3c39e19 · outbound

This paper cites Clustering to minimize the maximum intercluster distance.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Clustering to minimize the maximum intercluster distance

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.819120Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 73e7a437-cf5a-41d3-b172-4cdb556d2808 · outbound

This paper cites Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$".

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"

Reference 38

Resolution: verified exact; local_arxiv, observed 2026-08-16T11:54:16.580167Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation d851e88e-b014-4646-b3a6-ed3cf0b6c4d6 · outbound

This paper cites Optimal broadcast domination in polynomial time.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Optimal broadcast domination in polynomial time

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-16T11:54:16.386641Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d251c68-9db4-4325-9947-4a773225ab16 · outbound

This paper cites Dynamic clustering to minimize the sum of radii.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Dynamic clustering to minimize the sum of radii

Reference 40

Resolution: verified exact; doi, observed 2026-08-16T11:54:16.497103Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 272ddf17-0707-455d-94e3-aa94bbb71abb · outbound

This paper cites Approximation algorithms for fair range clustering.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Approximation algorithms for fair range clustering

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.806195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 5b3717e5-5cd3-4048-9b08-e3bd631fc2a9 · outbound

This paper cites Varadarajan.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Varadarajan

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-16T11:54:16.400614Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 77c74bef-2887-418b-a34f-8bc11c73767f · outbound

This paper cites FPT approximation for capacitated sum of radii.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering FPT approximation for capacitated sum of radii

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.792924Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 7fc260d1-2abc-48f3-9a95-de3a79d18968 · outbound

This paper cites Fair colorfulk-center clustering.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Fair colorfulk-center clustering

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.780037Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation cc5190bf-3bb2-4527-a301-ba6752cc504f · outbound

This paper cites A center in your neighborhood: Fairness in facility location.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering A center in your neighborhood: Fairness in facility location

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.767265Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation ced3313d-b31e-4618-a610-ea99c64ef2de · outbound

This paper cites Mount, Nathan S.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Mount, Nathan S

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.754012Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation f717f761-e5ce-41e2-979e-d29c368a0583 · outbound

This paper cites Fair k-center clustering for data summarization.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Fair k-center clustering for data summarization

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.740998Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 7687a5d8-4089-4e2d-8953-33e1e60e263a · outbound

This paper cites Constant approximation for k-median and k-means with outliers via iterative rounding.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Constant approximation for k-median and k-means with outliers via iterative rounding

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.728194Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1bf4c128-5bac-41b3-93c7-1c3983bc9227 · outbound

This paper cites Approximation algorithms for socially fair clustering.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Approximation algorithms for socially fair clustering

Reference 49

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.713933Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 9621a5e4-a1cd-4da5-a5c3-95cc68d53246 · outbound

This paper cites Proportionally fair clustering revisited.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Proportionally fair clustering revisited

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.699930Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 7c17ff45-9c98-447a-8b94-5bd0fb14b41c · outbound

This paper cites Better algorithms for individually fair k- clustering.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Better algorithms for individually fair k- clustering

Reference 51

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.686820Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 3b3db008-0549-4507-9f34-91c5d931828e · outbound

This paper cites Computing a many-to-many matching with de- mands and capacities between two sets using the hungarian algorithm.Journal of mathematics, 2023(1):7761902, 2023.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Computing a many-to-many matching with de- mands and capacities between two sets using the hungarian algorithm.Journal of mathematics, 2023(1):7761902, 2023

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.673893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation f6f9d3d5-64e9-492e-8841-f44a30e3bdd8 · outbound

This paper cites Fair coresets and streaming algorithms for fair k-means.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Fair coresets and streaming algorithms for fair k-means

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.660839Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation a872b4dc-6be0-43b4-9a5d-25a11c98e855 · outbound

This paper cites Improved approximation algorithms for individually fair clustering.

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering Improved approximation algorithms for individually fair clustering

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-08-16T11:54:16.646992Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Pith citing papers

Observation 1f2dce8f-f409-41d8-b331-a07e39f5c1bf · inbound

FPT Constant Approximation Algorithms for Colorful Sum of Radii cites this paper.

FPT Constant Approximation Algorithms for Colorful Sum of Radii Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering

Reference 23

Resolution: verified exact; local_arxiv, observed 2026-08-07T00:47:34.135877Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.