A (2+ε)-Approximation Algorithm for Metric 𝑘-Median

Saved in:
Bibliographic Details
Published inProceedings of the 57th Annual ACM Symposium on Theory of Computing
Format Conference Proceeding
LanguageEnglish
Online AccessGet full text
DOI10.1145/3717823.3718299

Cover

BookMark eNotjztOxDAYhF1AAQs1rUsQ8uJnHJfRipe0Kxqord-xDZGydmSCYI9BR8MxuAZn4QgEEWmkrxmN5jtEeymngNAJo0vGpLoQmumai-XEmhtzgHSDT_n599cZaYah5LduC2OXE276x1y68WmLYy54E8bStfjn8_2DbILvIB2h_Qj9czieuUAPV5f3qxuyvru-XTVrAowJQ6CK2k9xhkJspVG8rXntaAySMh-rKCSrnJqqXvKWOwWaauW14ZG5AFEsEP3ffUkD7F6h7-1QppNlZxm1f052drKzk_gFzYRGsA
ContentType Conference Proceeding
DBID ADTOC
UNPAY
DOI 10.1145/3717823.3718299
DatabaseName Unpaywall for CDI: Periodical Content
Unpaywall
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
ExternalDocumentID oai:pure.atira.dk:openaire/a79fcd15-b995-4c7c-8163-8fbce7427e7c
GroupedDBID ADTOC
UNPAY
ID FETCH-LOGICAL-a1139-a6f7df7db90afc4952c828b0fe401df6f3416b5139d42c2b5a7075d792f1beaf3
IEDL.DBID UNPAY
IngestDate Sun Oct 26 04:11:43 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
License other-oa
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a1139-a6f7df7db90afc4952c828b0fe401df6f3416b5139d42c2b5a7075d792f1beaf3
OpenAccessLink https://proxy.k.utb.cz/login?url=https://pure.au.dk/portal/en/publications/a79fcd15-b995-4c7c-8163-8fbce7427e7c
ParticipantIDs unpaywall_primary_10_1145_3717823_3718299
PublicationTitle Proceedings of the 57th Annual ACM Symposium on Theory of Computing
Score 1.9147825
SourceID unpaywall
SourceType Open Access Repository
Title A (2+ε)-Approximation Algorithm for Metric 𝑘-Median
URI https://pure.au.dk/portal/en/publications/a79fcd15-b995-4c7c-8163-8fbce7427e7c
UnpaywallVersion submittedVersion
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrZ3LSgMxFIZDbRfuVKyoqMzChUUy90w6yyKWIrS4sFBXQ04uWlqnpczg5S3cufExfA2fxUfwjDPW4k4QAtmEEHIW5ztJ_j-EHBtEIQhioGHkchqC8ChEilFkcT9gcehKU4iT-4OoNwwvRmxUI4NvLcw8XxRO9baaOCV_Ojp15isnWI7gsZHKYxQKcXEouaRthAraNiA1Fnpcc7lGGhFDNq-TxnBw2bmuPH28kDkB1i9tP7Cxb_uF4-t6ns7F472YTlcSS3eDzJZL-npPMrHzDGz59Mut8f_WvEmaPyI_63KZvrZITafbhHesE__0_a1FO4XZ-MO4VDZanenNbDHObu8shFyrX3zDJa2P1-cXWtz0iLRJht3zq7Merf5WoMJD6KMiMlxhg9gVRhaRkVh7gWs0FlzKRAazWwQMh6rQlz4wwREuFI9944EWJtgh9XSW6l1iAShmwDfC1TgREo8Ao7VGcuRBHGm1R1rLLU7mpYdGUuqhWVKFI6nCsf-HsQekni1yfYhQkMFRFelPVS-5rQ
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrZ3LSgMxFIZDbRfuVKyoqMzChUUy90w6yyKWIrS4sFBXQ04uWlqnpczg5S3cufExfA2fxUfwjDPW4k4QAtmEEHIW5ztJ_j-EHBtEIQhioGHkchqC8ChEilFkcT9gcehKU4iT-4OoNwwvRmxUI4NvLcw8XxRO9baaOCV_Ojp15isnWI7gsZHKYxQKcXEouaRthAraNiA1Fnpcc7lGGhFDNq-TxnBw2bmuPH28kDkB1i9tP7Cxb_uF4-t6ns7F472YTlcSS3eDzJZL-npPMrHzDGz59Mut8f_WvEmaPyI_63KZvrZITafbhHesE__0_a1FO4XZ-MO4VDZanenNbDHObu8shFyrX3zDJa2P1-cXWtz0iLRJht3zq7Merf5WoMJD6KMiMlxhg9gVRhaRkVh7gWs0FlzKRAazWwQMh6rQlz4wwREuFI9944EWJtgh9XSW6l1iAShmwDfC1TgREo8Ao7VGcuRBHGm1R1rLLU7mpYdGUuqhWVKFI6nCsf-HsQekni1yfYhQkMFRFelPVS-5rQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+57th+Annual+ACM+Symposium+on+Theory+of+Computing&rft.atitle=A+%282%2B%CE%B5%29-Approximation+Algorithm+for+Metric+%F0%9D%91%98-Median&rft_id=info:doi/10.1145%2F3717823.3718299&rft.externalDocID=oai%3Apure.atira.dk%3Aopenaire%2Fa79fcd15-b995-4c7c-8163-8fbce7427e7c