A tree structure for dynamic facility location
In this paper, we study the problem of dynamic facility location. We maintain a solution with cost O(1) times the cost of an optimal solution in metric spaces with bounded doubling dimension. The amortized update time is polylogarithmic in the parameters of the problem.
Uloženo v:
| Vydáno v: | Algorithmica |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Springer Verlag
2020
|
| Témata: | |
| ISSN: | 0178-4617, 1432-0541 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | In this paper, we study the problem of dynamic facility location. We maintain a solution with cost O(1) times the cost of an optimal solution in metric spaces with bounded doubling dimension. The amortized update time is polylogarithmic in the parameters of the problem. |
|---|---|
| AbstractList | In this paper, we study the problem of dynamic facility location. We maintain a solution with cost O(1) times the cost of an optimal solution in metric spaces with bounded doubling dimension. The amortized update time is polylogarithmic in the parameters of the problem. |
| Author | Leniowski, Dariusz Mathieu, Claire Henzinger, Monika |
| Author_xml | – sequence: 1 givenname: Monika surname: Henzinger fullname: Henzinger, Monika – sequence: 2 givenname: Dariusz surname: Leniowski fullname: Leniowski, Dariusz – sequence: 3 givenname: Claire surname: Mathieu fullname: Mathieu, Claire organization: Institut de Recherche en Informatique Fondamentale |
| BackLink | https://hal.science/hal-03112038$$DView record in HAL |
| BookMark | eNotzM1Kw0AUQOFBKphWH8Bdti4S7838ZhmK2kLATRfuwp3JDI6kiUzSQt5eRFcHvsXZss04jZ6xR4RSGCnhmdJHvJZYQ12CUpLfsAwFrwqQAjcsA9SmEAr1HdvO8xcAVrpWGSubfEne5_OSLm65JJ-HKeX9OtI5ujyQi0Nc1nyYHC1xGu_ZbaBh9g__3bHT68tpfyja97fjvmkLkgYLCjYooYLQYI3gKMlprrFHbixRCIasrrgUmhB6A0AcnDJQa-Vrb8nyHXv6237S0H2neKa0dhPF7tC03a8BR6yAmyvyHyO5SOg |
| ContentType | Journal Article |
| Copyright | Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | 1XC |
| DOI | 10.48550/arXiv.1909.06653 |
| DatabaseName | Hyper Article en Ligne (HAL) |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1432-0541 |
| ExternalDocumentID | oai:HAL:hal-03112038v1 |
| GroupedDBID | -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 1XC 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO ABAKF ABBBX ABBRH ABBXA ABDBE ABDPE ABDZT ABECU ABFSG ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABRTQ ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADHKG ADIMF ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFGCZ AFHIU AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHSBF AHWEU AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WK8 YLTOR Z45 ZMTXR ZY4 ~EX |
| ID | FETCH-LOGICAL-a581-afbf646f470b84315ac7371d138baaff8ab723547a10d800a30c680976e9ebab3 |
| ISSN | 0178-4617 |
| IngestDate | Tue Oct 14 20:20:35 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | doubling dimension approximation clustering phrases dynamic algorithm |
| Language | English |
| License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a581-afbf646f470b84315ac7371d138baaff8ab723547a10d800a30c680976e9ebab3 |
| OpenAccessLink | https://arxiv.org/abs/1909.06653 |
| ParticipantIDs | hal_primary_oai_HAL_hal_03112038v1 |
| PublicationCentury | 2000 |
| PublicationDate | 2020 |
| PublicationDateYYYYMMDD | 2020-01-01 |
| PublicationDate_xml | – year: 2020 text: 2020 |
| PublicationDecade | 2020 |
| PublicationTitle | Algorithmica |
| PublicationYear | 2020 |
| Publisher | Springer Verlag |
| Publisher_xml | – name: Springer Verlag |
| SSID | ssj0012796 |
| Score | 2.2229457 |
| SecondaryResourceType | preprint |
| Snippet | In this paper, we study the problem of dynamic facility location. We maintain a solution with cost O(1) times the cost of an optimal solution in metric spaces... |
| SourceID | hal |
| SourceType | Open Access Repository |
| SubjectTerms | Computer Science Data Structures and Algorithms |
| Title | A tree structure for dynamic facility location |
| URI | https://hal.science/hal-03112038 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLink Journals customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NT-MwELUq4MBl-drVLrDIWnFbpSRxGjsXpAgWFW1VoaVCvUV27GwjuikqpSB-PTPORwvsAQ5crMqpKsevGr95M54h5NBTJhIqylDX0A4wcOUI8DMco4SvU51yY7soXPV4vy-Gw-ii1Tqu78LMx7woxMNDdPOhUMMcgI1XZ98Bd_OjMAGfAXQYAXYY3wR8jMnjWDcWC8NieAATCXXZeB7b6-SWeOMZ1mBSV6Ed_51M89no31L-TtcUj1b5s8opGIDr5lHPFPnkvup7fQo-993t40Lgno1yc2dl2LGsM2wrdcF3X-mKP5d0xUqCBL8zCMsbl21Tms2A-Q6QP-9_RtnWTMMjZzrM520gIFEb4z1scQLVUfdufJlcnJ4lvfP-7-dPl7IGu3EPxpEcO2CPPN9lYg7e76rPOxG27vhzedVEkXxu-7M1Ky6j2nY9Ry9XA9xiVGvpllsMNsmnyimgcQnmFmmZYpts1A03aGV_d0g7pogtbbClgC2tsKU1trTG9jMZnP0anHSdquGFIzvCc2SmsjAIs4C7SgCx68iUM-5pjwklZZYJqbjPOgGXnquB6EvmpqFwgVCayCip2BeyUkwK85VQJmRoUk9yV-sgU-A1RoIbzbhiWIHR_0Z-wNsmN2VFkwRrjMO-Jji32NXdt3xpj6zj_6ZUpfbJCmyA-U7W0vksv50eWDyeAHjTQOc |
| linkProvider | Springer Nature |
| 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%3Ajournal&rft.genre=article&rft.atitle=A+tree+structure+for+dynamic+facility+location&rft.jtitle=Algorithmica&rft.au=Henzinger%2C+Monika&rft.au=Leniowski%2C+Dariusz&rft.au=Mathieu%2C+Claire&rft.date=2020&rft.pub=Springer+Verlag&rft.issn=0178-4617&rft.eissn=1432-0541&rft_id=info:doi/10.48550%2FarXiv.1909.06653&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-03112038v1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon |