Work

Fully Dynamic $k-\text{Clustering}$ with Fast Update Time and Small Recourse

Year: 2024

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/focs61266.2024.00023

Authors: Sayan Bhattacharya, Martín Costa, Naveen Garg, Silvio Lattanzi, Nikos Parotsidis

Institutions: University of Warwick, Indian Institute of Technology Delhi, Google (Switzerland)

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W4404848461

FWCI: 0.66

Cites: 16

Cited by: 1

Related to: 10