z-logo
open-access-imgOpen Access
Parameterized Approximation Algorithms for K-center Clustering and Variants
Author(s) -
Sayan Bandyapadhyay,
Zachary Friggstad,
Ramin Mousavi
Publication year - 2022
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v36i4.20305
Subject(s) - combinatorics , approximation algorithm , center (category theory) , parameterized complexity , complement (music) , upper and lower bounds , mathematics , radius , dimension (graph theory) , generalization , time complexity , exponential time hypothesis , euclidean geometry , polynomial , vc dimension , discrete mathematics , mathematical analysis , geometry , crystallography , computer science , biochemistry , chemistry , computer security , complementation , phenotype , gene

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom