Faster Randomized and Deterministic k-Clustering on Graphs | Paper Citation Record

Observation d8c6b6c2-9e16-43a1-a388-c27fe752e322 · outbound

This paper cites On the fine- grained complexity of approximating k-center in sparse graphs.

Faster Randomized and Deterministic k-Clustering on Graphs On the fine- grained complexity of approximating k-center in sparse graphs

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.916181Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation cb503389-5dc8-4a12-852d-1615436303b1 · outbound

This paper cites Aggarwal and Chandan K.

Faster Randomized and Deterministic k-Clustering on Graphs Aggarwal and Chandan K

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.910068Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 35c831bf-66d7-44e5-bc48-fab8786aebfa · outbound

This paper cites Better Guarantees for k-Means and.

Faster Randomized and Deterministic k-Clustering on Graphs Better Guarantees for k-Means and

Reference 3

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.010886Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation beb78ff7-b7e6-475e-aa5c-7e3328d79d61 · outbound

This paper cites Euclidean spanners: short, thin, and lanky.

Faster Randomized and Deterministic k-Clustering on Graphs Euclidean spanners: short, thin, and lanky

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.912012Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 77784e43-d4c6-4e1f-9531-d378013a1916 · outbound

This paper cites Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing , pages =.

Faster Randomized and Deterministic k-Clustering on Graphs Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing , pages =

Reference 5

Resolution: metadata mismatch; arxiv_id, observed 2026-07-09T05:36:00.998139Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 51c52dc7-ee47-4c7a-9818-ad49ab37b3cc · outbound

This paper cites 37th Annual Symposium on Foundations of Computer Science.

Faster Randomized and Deterministic k-Clustering on Graphs 37th Annual Symposium on Foundations of Computer Science

Reference 6

Resolution: verified exact; arxiv_id, observed 2026-07-09T05:36:01.002548Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 359ece73-11ea-4b8b-972f-60953cb9c8f4 · outbound

This paper cites Optimal fully dynamick-center clustering for adaptive and oblivious adversaries.

Faster Randomized and Deterministic k-Clustering on Graphs Optimal fully dynamick-center clustering for adaptive and oblivious adversaries

Reference 7

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.064022Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation d5a52e09-d634-4dd4-8b6e-3e3e75795df4 · outbound

This paper cites A survey of clustering data mining techniques.

Faster Randomized and Deterministic k-Clustering on Graphs A survey of clustering data mining techniques

Reference 8

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.068961Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 07db4793-b844-4c70-946e-7ed25c5af91d · outbound

This paper cites An improved approximation fork-median and positive correlation in budgeted optimization.

Faster Randomized and Deterministic k-Clustering on Graphs An improved approximation fork-median and positive correlation in budgeted optimization

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.914064Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 3be6ce3f-a3c6-459a-9de9-515c545d2763 · outbound

This paper cites Rounding via trees: Deterministic approximation algorithms for group steiner trees andk-median.

Faster Randomized and Deterministic k-Clustering on Graphs Rounding via trees: Deterministic approximation algorithms for group steiner trees andk-median

Reference 10

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.039324Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b3a4ae5a-1a78-445f-aaf0-cc2c028c4f71 · outbound

This paper cites Tight pair query lower bounds for matching and earth mover’s distance.

Faster Randomized and Deterministic k-Clustering on Graphs Tight pair query lower bounds for matching and earth mover’s distance

Reference 11

Resolution: metadata mismatch; arxiv_id, observed 2026-07-09T05:36:01.094162Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b712cac9-fadf-444e-a21f-7515d64efa59 · outbound

This paper cites Improved combinatorial algorithms for facility location problems.SIAM J.

Faster Randomized and Deterministic k-Clustering on Graphs Improved combinatorial algorithms for facility location problems.SIAM J

Reference 12

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.036726Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 89157c27-a273-4547-b457-bd0c4cfbd826 · outbound

This paper cites A Constant-Factor Approximation Algorithm for the k -Median Problem , journal =.

Faster Randomized and Deterministic k-Clustering on Graphs A Constant-Factor Approximation Algorithm for the k -Median Problem , journal =

Reference 13

Resolution: verified exact; arxiv_id, observed 2026-07-09T05:36:01.083937Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation bc6b5c3c-20f7-4905-99a4-e29d397a33d5 · outbound

This paper cites Mount, and Giri Narasimhan.

Faster Randomized and Deterministic k-Clustering on Graphs Mount, and Giri Narasimhan

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.908176Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 36d707ea-b6bc-406c-86c9-af86b873f9ea · outbound

This paper cites A dependent lp-rounding approach for the k-median problem.

Faster Randomized and Deterministic k-Clustering on Graphs A dependent lp-rounding approach for the k-median problem

Reference 15

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.034075Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7adab7e8-5e9f-4572-8d44-a3a1c8af8f16 · outbound

This paper cites On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications.SIAM J.

Faster Randomized and Deterministic k-Clustering on Graphs On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications.SIAM J

Reference 16

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.077310Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 04413630-ee44-42c4-91b9-4a4d3fd69f0c · outbound

This paper cites Size-estimation framework with applications to transitive closure and reachability.

Faster Randomized and Deterministic k-Clustering on Graphs Size-estimation framework with applications to transitive closure and reachability

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.906310Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation ac529a2c-e6f2-4408-98df-d29a9e2f0b10 · outbound

This paper cites All-pairs small-stretch paths.J.

Faster Randomized and Deterministic k-Clustering on Graphs All-pairs small-stretch paths.J

Reference 18

Resolution: verified exact; arxiv_id, observed 2026-07-09T05:36:01.042902Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a97cc758-b20c-4995-82b2-84f42ba5b4ee · outbound

This paper cites Breach- ing the 2 LMP approximation barrier for facility location with applications tok-median.

Faster Randomized and Deterministic k-Clustering on Graphs Breach- ing the 2 LMP approximation barrier for facility location with applications tok-median

Reference 19

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.013387Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 70721d2a-683b-4098-9c81-49450a4b2378 · outbound

This paper cites A (2 +ε)-approximation algorithm for metric k-median.

Faster Randomized and Deterministic k-Clustering on Graphs A (2 +ε)-approximation algorithm for metric k-median

Reference 20

Resolution: malformed identifier; arxiv_id, observed 2026-07-09T05:36:01.264342Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 79f7d428-38b1-4f43-9158-e5bfad0dbebf · outbound

This paper cites An improved local search algorithm for k-median.

Faster Randomized and Deterministic k-Clustering on Graphs An improved local search algorithm for k-median

Reference 21

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.016076Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 3d5480c0-e399-4a3c-b4da-6b952d9900af · outbound

This paper cites Deterministic k-median clustering in near-optimal time.

Faster Randomized and Deterministic k-Clustering on Graphs Deterministic k-median clustering in near-optimal time

Reference 22

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.059075Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c0bf7b85-247f-4eb1-be2d-b46eb25713f5 · outbound

This paper cites Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction.

Faster Randomized and Deterministic k-Clustering on Graphs Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction

Reference 23

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.066712Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 821095e3-1007-4bf6-bac8-81a75678ed38 · outbound

This paper cites Optimal euclidean spanners: Really short, thin, and lanky.J.

Faster Randomized and Deterministic k-Clustering on Graphs Optimal euclidean spanners: Really short, thin, and lanky.J

Reference 24

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.071343Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 9ef59305-3a21-4edb-9916-6212db59279a · outbound

This paper cites an unresolved cited work.

Faster Randomized and Deterministic k-Clustering on Graphs Unresolved cited work

Reference 25

Resolution: verified exact; arxiv_id, observed 2026-07-09T05:36:01.022379Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b6f3fab7-d71b-4f9d-8bfa-bf02c1b535a0 · outbound

This paper cites On strong diameter padded decompositions.

Faster Randomized and Deterministic k-Clustering on Graphs On strong diameter padded decompositions

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.904407Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 14a7722a-3261-476c-8bcb-dc691f3edd52 · outbound

This paper cites González.

Faster Randomized and Deterministic k-Clustering on Graphs González

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.900591Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 5f2888e4-f016-4fd5-8842-dd84dffce9a7 · outbound

This paper cites On incremental approximate shortest paths in directed graphs.

Faster Randomized and Deterministic k-Clustering on Graphs On incremental approximate shortest paths in directed graphs

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.902463Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 4e921e85-232f-4daa-a432-306321812186 · outbound

This paper cites Gowda, Thomas W.

Faster Randomized and Deterministic k-Clustering on Graphs Gowda, Thomas W

Reference 29

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.054930Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation ac40d49a-a2be-4b23-84bf-d86a361e2e95 · outbound

This paper cites Clustering data streams.

Faster Randomized and Deterministic k-Clustering on Graphs Clustering data streams

Reference 30

Resolution: verified exact; arxiv_id, observed 2026-07-09T05:36:01.047850Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b72b8484-0594-4216-8ece-546e183b44d6 · outbound

This paper cites Simpler Analyses of Local Search Algorithms for Facility Location.

Faster Randomized and Deterministic k-Clustering on Graphs Simpler Analyses of Local Search Algorithms for Facility Location

Reference 31

Resolution: verified exact; local_arxiv, observed 2026-07-09T05:36:01.260849Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation fabe1fae-f332-48c3-a2ce-957f1094332b · outbound

This paper cites Cluster analysis and mathematical programming.Math.

Faster Randomized and Deterministic k-Clustering on Graphs Cluster analysis and mathematical programming.Math

Reference 32

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.090463Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b432c5d0-9e30-4fd0-baec-6a8ed0eae2bc · outbound

This paper cites Clustering motion.Discret.

Faster Randomized and Deterministic k-Clustering on Graphs Clustering motion.Discret

Reference 33

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.031085Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 568319e5-c9a1-4953-8eb2-682c446c5f28 · outbound

This paper cites Euclidean spanners in high di- mensions.

Faster Randomized and Deterministic k-Clustering on Graphs Euclidean spanners in high di- mensions

Reference 34

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.061626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a804d6bb-beb2-48a2-9551-b538606a0d0e · outbound

This paper cites Hochbaum and David B.

Faster Randomized and Deterministic k-Clustering on Graphs Hochbaum and David B

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.944678Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 831c4af8-6f57-4b72-a724-e3afd3fd1a2a · outbound

This paper cites Sublinear time algorithms for metric space problems.

Faster Randomized and Deterministic k-Clustering on Graphs Sublinear time algorithms for metric space problems

Reference 36

Resolution: verified exact; arxiv_id, observed 2026-07-09T05:36:01.088263Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7a6d8fae-2504-4e29-b3c0-3b6c34c41df9 · outbound

This paper cites ACM Computing Surveys31(3), 264–323 (1999) https://doi.org/10.1145/331499.331504.

Faster Randomized and Deterministic k-Clustering on Graphs ACM Computing Surveys31(3), 264–323 (1999) https://doi.org/10.1145/331499.331504

Reference 37

Resolution: verified exact; arxiv_id, observed 2026-07-09T05:36:01.051623Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c5708c47-3f8d-4251-a905-035e4b383b67 · outbound

This paper cites Vazirani.

Faster Randomized and Deterministic k-Clustering on Graphs Vazirani

Reference 38

Resolution: verified exact; arxiv_id, observed 2026-07-09T05:36:01.074761Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 4d6a7b35-c4db-45e3-8de3-a81cb646b8d2 · outbound

This paper cites A new greedy approach for facility location problems.

Faster Randomized and Deterministic k-Clustering on Graphs A new greedy approach for facility location problems

Reference 39

Resolution: verified exact; arxiv_id, observed 2026-07-09T05:36:01.008007Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 58241db2-acbf-4a98-add9-51aaf18cd762 · outbound

This paper cites Vazirani.

Faster Randomized and Deterministic k-Clustering on Graphs Vazirani

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.942865Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 63648e53-a07e-4e80-bdda-216c61a08538 · outbound

This paper cites Local search for clustering in almost-linear time.

Faster Randomized and Deterministic k-Clustering on Graphs Local search for clustering in almost-linear time

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.936518Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7d0cf9a8-17fe-425a-87ba-c55668eb586f · outbound

This paper cites The price of incrementality in k-center clustering.

Faster Randomized and Deterministic k-Clustering on Graphs The price of incrementality in k-center clustering

Reference 42

Resolution: verified exact; local_arxiv, observed 2026-07-09T05:36:01.271669Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation afff5cf9-091d-4cd4-b3bf-267ba394e50c · outbound

This paper cites Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means.

Faster Randomized and Deterministic k-Clustering on Graphs Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means

Reference 43

Resolution: verified exact; local_arxiv, observed 2026-07-09T05:36:01.276322Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 9b29963c-ee4e-4a00-a12c-c918f78932c2 · outbound

This paper cites Truly optimal euclidean spanners.SIAM Journal on Computing, 54(4):FOCS19–135, 2025.

Faster Randomized and Deterministic k-Clustering on Graphs Truly optimal euclidean spanners.SIAM Journal on Computing, 54(4):FOCS19–135, 2025

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.938735Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 5a024fd0-470e-4d66-827b-af72f59dc14f · outbound

This paper cites 2016 , url =.

Faster Randomized and Deterministic k-Clustering on Graphs 2016 , url =

Reference 45

Resolution: metadata mismatch; doi, observed 2026-07-09T05:36:00.981990Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 397834d0-380a-4c62-a19a-f65ca2136cab · outbound

This paper cites Williamson.

Faster Randomized and Deterministic k-Clustering on Graphs Williamson

Reference 46

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.025579Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 17ff2797-b7d9-4bc2-8677-00eb8092916c · outbound

This paper cites Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms.

Faster Randomized and Deterministic k-Clustering on Graphs Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms

Reference 47

Resolution: metadata mismatch; arxiv_id, observed 2026-07-09T05:36:00.990815Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 74c8c37e-5538-4f49-b535-80d8cd52c668 · outbound

This paper cites The online median problem.SIAM Journal on Computing, 32(3):816–832, 2003.

Faster Randomized and Deterministic k-Clustering on Graphs The online median problem.SIAM Journal on Computing, 32(3):816–832, 2003

Reference 48

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.940951Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation cca6e92a-885c-47e6-a710-5b7af630fc97 · outbound

This paper cites Mettu and C.

Faster Randomized and Deterministic k-Clustering on Graphs Mettu and C

Reference 49

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.028261Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 1761d4e3-3da5-4f81-a7a4-e99ca634ef64 · outbound

This paper cites Deterministic constructions of approximate distance oracles and spanners.

Faster Randomized and Deterministic k-Clustering on Graphs Deterministic constructions of approximate distance oracles and spanners

Reference 50

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.946747Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 47db78f5-9f8b-4723-be43-6e8da9aba6f2 · outbound

This paper cites On dynamic shortest paths problems.Algorithmica, 61(2):389–401, 2011.

Faster Randomized and Deterministic k-Clustering on Graphs On dynamic shortest paths problems.Algorithmica, 61(2):389–401, 2011

Reference 51

Resolution: verified exact; doi, observed 2026-07-09T05:36:01.079952Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 0969efc1-9670-4ab8-889a-360b926e1401 · outbound

This paper cites Quick k-median, k-center, and facility location for sparse graphs.

Faster Randomized and Deterministic k-Clustering on Graphs Quick k-median, k-center, and facility location for sparse graphs

Reference 52

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.930615Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 02844eda-af23-40cb-be3d-62b5a17e4313 · outbound

This paper cites Quick k-median, k-center, and facility location for sparse graphs.SIAM Journal on Computing, 34(2):405–432, 2005.

Faster Randomized and Deterministic k-Clustering on Graphs Quick k-median, k-center, and facility location for sparse graphs.SIAM Journal on Computing, 34(2):405–432, 2005

Reference 53

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.932755Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 73044e5a-0c5d-4e49-8aa1-09cbcb61bc7a · outbound

This paper cites Compact routing schemes.

Faster Randomized and Deterministic k-Clustering on Graphs Compact routing schemes

Reference 54

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.934585Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7c86ea44-6b76-48b3-9d53-349e6fcef8d4 · outbound

This paper cites Approximate distance oracles.Journal of the ACM (JACM), 52(1):1–24, 2005.

Faster Randomized and Deterministic k-Clustering on Graphs Approximate distance oracles.Journal of the ACM (JACM), 52(1):1–24, 2005

Reference 55

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.928632Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation bdfd7d59-705f-4d07-b045-a21b255ab4ac · outbound

This paper cites Statistics and Computing 17: 395--416.

Faster Randomized and Deterministic k-Clustering on Graphs Statistics and Computing 17: 395--416

Reference 56

Resolution: metadata mismatch; doi, observed 2026-07-09T05:36:01.018861Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 0454d9db-970e-4cd9-9bf5-eb84a047bbe2 · outbound

This paper cites Shmoys.The Design of Approximation Algorithms.

Faster Randomized and Deterministic k-Clustering on Graphs Shmoys.The Design of Approximation Algorithms

Reference 57

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.926669Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f564ea21-e647-4c38-a4e7-cbb0ef02d4d3 · outbound

This paper cites In turn, the constraint onc becomes c≥ ρ2 2 instead ofc≥5.

Faster Randomized and Deterministic k-Clustering on Graphs In turn, the constraint onc becomes c≥ ρ2 2 instead ofc≥5

Reference 58

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.920515Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 71869e2b-0587-4a70-8fd5-ff3a4aa54479 · outbound

This paper cites When cost(In(Pγ), Ck)is analyzed in the proof of Lemma A.5, the constant3can be trivially replaced by ρ, since (rγ)z · |B(γ, r γ)| ≤ρ·Value(B(γ, r γ)).

Faster Randomized and Deterministic k-Clustering on Graphs When cost(In(Pγ), Ck)is analyzed in the proof of Lemma A.5, the constant3can be trivially replaced by ρ, since (rγ)z · |B(γ, r γ)| ≤ρ·Value(B(γ, r γ))

Reference 59

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.918440Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 978b7d72-8cd2-4c87-a0dd-8d4823636b63 · outbound

This paper cites When cost(B(x, c·r ), Γ) is analyzed in the proof of Lemma A.6, the constant3can be trivially replaced byρ, since rz · |B(x, c·r)| ≥ Value(B(x,r)) ρ.

Faster Randomized and Deterministic k-Clustering on Graphs When cost(B(x, c·r ), Γ) is analyzed in the proof of Lemma A.6, the constant3can be trivially replaced byρ, since rz · |B(x, c·r)| ≥ Value(B(x,r)) ρ

Reference 60

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.922621Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 555753fb-d05f-49b1-b051-8da58ef50426 · outbound

This paper cites Bk-Center with Outliers We now extend the incremental framework developed in Section 3 to thek-center problem with outliers, where up tot points may be discarded.

Faster Randomized and Deterministic k-Clustering on Graphs Bk-Center with Outliers We now extend the incremental framework developed in Section 3 to thek-center problem with outliers, where up tot points may be discarded

Reference 61

Resolution: verified fuzzy; raw_fallback, observed 2026-07-09T05:36:01.924666Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Coverage vector

Reference resolution

Outbound references

Pith citing papers