Matches in SemOpenAlex for { <https://semopenalex.org/work/W4311321429> ?p ?o ?g. }
Showing items 1 to 77 of
77
with 100 items per page.
- W4311321429 abstract "This paper presents universal algorithms for clustering problems, including the widely studied $k$-median, $k$-means, and $k$-center objectives. The input is a metric space containing all potential client locations. The algorithm must select $k$ cluster centers such that they are a good solution for any subset of clients that actually realize. Specifically, we aim for low regret, defined as the maximum over all subsets of the difference between the cost of the algorithm's solution and that of an optimal solution. A universal algorithm's solution $SOL$ for a clustering problem is said to be an $(alpha, beta)$-approximation if for all subsets of clients $C'$, it satisfies $SOL(C') leq alpha cdot OPT(C') + beta cdot MR$, where $OPT(C')$ is the cost of the optimal solution for clients $C'$ and $MR$ is the minimum regret achievable by any solution. Our main results are universal algorithms for the standard clustering objectives of $k$-median, $k$-means, and $k$-center that achieve $(O(1), O(1))$-approximations. These results are obtained via a novel framework for universal algorithms using linear programming (LP) relaxations. These results generalize to other $ell_p$-objectives and the setting where some subset of the clients are fixed. We also give hardness results showing that $(alpha, beta)$-approximation is NP-hard if $alpha$ or $beta$ is at most a certain constant, even for the widely studied special case of Euclidean metric spaces. This shows that in some sense, $(O(1), O(1))$-approximation is the strongest type of guarantee obtainable for universal clustering." @default.
- W4311321429 created "2022-12-25" @default.
- W4311321429 creator A5032529325 @default.
- W4311321429 creator A5046808993 @default.
- W4311321429 creator A5087182068 @default.
- W4311321429 date "2021-05-05" @default.
- W4311321429 modified "2023-09-30" @default.
- W4311321429 title "Universal Algorithms for Clustering Problems" @default.
- W4311321429 doi "https://doi.org/10.48550/arxiv.2105.02363" @default.
- W4311321429 hasPublicationYear "2021" @default.
- W4311321429 type Work @default.
- W4311321429 citedByCount "0" @default.
- W4311321429 crossrefType "posted-content" @default.
- W4311321429 hasAuthorship W4311321429A5032529325 @default.
- W4311321429 hasAuthorship W4311321429A5046808993 @default.
- W4311321429 hasAuthorship W4311321429A5087182068 @default.
- W4311321429 hasBestOaLocation W43113214291 @default.
- W4311321429 hasConcept C105795698 @default.
- W4311321429 hasConcept C111919701 @default.
- W4311321429 hasConcept C11413529 @default.
- W4311321429 hasConcept C114614502 @default.
- W4311321429 hasConcept C118615104 @default.
- W4311321429 hasConcept C126255220 @default.
- W4311321429 hasConcept C148764684 @default.
- W4311321429 hasConcept C162324750 @default.
- W4311321429 hasConcept C164866538 @default.
- W4311321429 hasConcept C176217482 @default.
- W4311321429 hasConcept C185592680 @default.
- W4311321429 hasConcept C186450821 @default.
- W4311321429 hasConcept C198043062 @default.
- W4311321429 hasConcept C199360897 @default.
- W4311321429 hasConcept C21547014 @default.
- W4311321429 hasConcept C2778572836 @default.
- W4311321429 hasConcept C2779463800 @default.
- W4311321429 hasConcept C33923547 @default.
- W4311321429 hasConcept C41008148 @default.
- W4311321429 hasConcept C50817715 @default.
- W4311321429 hasConcept C73555534 @default.
- W4311321429 hasConcept C8010536 @default.
- W4311321429 hasConceptScore W4311321429C105795698 @default.
- W4311321429 hasConceptScore W4311321429C111919701 @default.
- W4311321429 hasConceptScore W4311321429C11413529 @default.
- W4311321429 hasConceptScore W4311321429C114614502 @default.
- W4311321429 hasConceptScore W4311321429C118615104 @default.
- W4311321429 hasConceptScore W4311321429C126255220 @default.
- W4311321429 hasConceptScore W4311321429C148764684 @default.
- W4311321429 hasConceptScore W4311321429C162324750 @default.
- W4311321429 hasConceptScore W4311321429C164866538 @default.
- W4311321429 hasConceptScore W4311321429C176217482 @default.
- W4311321429 hasConceptScore W4311321429C185592680 @default.
- W4311321429 hasConceptScore W4311321429C186450821 @default.
- W4311321429 hasConceptScore W4311321429C198043062 @default.
- W4311321429 hasConceptScore W4311321429C199360897 @default.
- W4311321429 hasConceptScore W4311321429C21547014 @default.
- W4311321429 hasConceptScore W4311321429C2778572836 @default.
- W4311321429 hasConceptScore W4311321429C2779463800 @default.
- W4311321429 hasConceptScore W4311321429C33923547 @default.
- W4311321429 hasConceptScore W4311321429C41008148 @default.
- W4311321429 hasConceptScore W4311321429C50817715 @default.
- W4311321429 hasConceptScore W4311321429C73555534 @default.
- W4311321429 hasConceptScore W4311321429C8010536 @default.
- W4311321429 hasLocation W43113214291 @default.
- W4311321429 hasOpenAccess W4311321429 @default.
- W4311321429 hasPrimaryLocation W43113214291 @default.
- W4311321429 hasRelatedWork W1536470053 @default.
- W4311321429 hasRelatedWork W1970866964 @default.
- W4311321429 hasRelatedWork W2012929417 @default.
- W4311321429 hasRelatedWork W2810411596 @default.
- W4311321429 hasRelatedWork W3001164300 @default.
- W4311321429 hasRelatedWork W3090652501 @default.
- W4311321429 hasRelatedWork W3114244520 @default.
- W4311321429 hasRelatedWork W3119173924 @default.
- W4311321429 hasRelatedWork W3159392702 @default.
- W4311321429 hasRelatedWork W4287658769 @default.
- W4311321429 isParatext "false" @default.
- W4311321429 isRetracted "false" @default.
- W4311321429 workType "article" @default.