Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point j has a requirement that t j distinct facilities serve it. This is the first constant performance guarantee known for this...
Gespeichert in:
| Veröffentlicht in: | Journal of combinatorial optimization 2024-03, Vol.47 (2), Article 14 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 2 |
| container_start_page | |
| container_title | Journal of combinatorial optimization |
| container_volume | 47 |
| creator | Guo, Yingying Li, Qiaoliang |
| description | This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point
j
has a requirement that
t
j
distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements are the same. |
| doi_str_mv | 10.1007/s10878-024-01106-0 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2932148372</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2932148372</sourcerecordid><originalsourceid>FETCH-LOGICAL-c270t-d95b17d4ab6a89fcfb23a0b70355bc50e9267563438e94c3c7914cf03bbbc3c83</originalsourceid><addsrcrecordid>eNp9kE9LxDAQxYMouK5-AU8Fz9FJ0jbpcVn8Bwte9BySbLrbJW1qkqL77Y1W8OZp5sH7DW8eQtcEbgkAv4sEBBcYaImBEKgxnKAFqTjDVIj6NO9MUFw3UJ2jixgPAJD3coHMahyD_-x6lTo_FMrtfOjSvo9F60OR9rZo1eQSTt7ZoIaUpelcl46F82ZmMq-d7YuPzBVx0r3fTk6FYrSDcqmz8RKdtcpFe_U7l-jt4f51_YQ3L4_P69UGG8oh4W1TacK3pdK1Ek1rWk2ZAs2BVZU2FdiG1ryqWcmEbUrDDG9IaVpgWuusBFuim_luTvQ-2ZjkwU8hh4iSNoySUjBOs4vOLhN8jMG2cgz5_XCUBOR3mXIuU-Yy5U-ZEjLEZihm87Cz4e_0P9QXP7p5nQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2932148372</pqid></control><display><type>article</type><title>Approximation algorithms for the fault-tolerant facility location problem with submodular penalties</title><source>SpringerLink Journals - AutoHoldings</source><creator>Guo, Yingying ; Li, Qiaoliang</creator><creatorcontrib>Guo, Yingying ; Li, Qiaoliang</creatorcontrib><description>This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point
j
has a requirement that
t
j
distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements are the same.</description><identifier>ISSN: 1382-6905</identifier><identifier>EISSN: 1573-2886</identifier><identifier>DOI: 10.1007/s10878-024-01106-0</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Approximation ; Combinatorics ; Convex and Discrete Geometry ; Fault tolerance ; Mathematical analysis ; Mathematical Modeling and Industrial Mathematics ; Mathematics ; Mathematics and Statistics ; Operations research ; Operations Research/Decision Theory ; Optimization ; Rounding ; Site selection ; Theory of Computation</subject><ispartof>Journal of combinatorial optimization, 2024-03, Vol.47 (2), Article 14</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c270t-d95b17d4ab6a89fcfb23a0b70355bc50e9267563438e94c3c7914cf03bbbc3c83</cites><orcidid>0000-0001-5428-4414</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10878-024-01106-0$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10878-024-01106-0$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>Guo, Yingying</creatorcontrib><creatorcontrib>Li, Qiaoliang</creatorcontrib><title>Approximation algorithms for the fault-tolerant facility location problem with submodular penalties</title><title>Journal of combinatorial optimization</title><addtitle>J Comb Optim</addtitle><description>This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point
j
has a requirement that
t
j
distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements are the same.</description><subject>Algorithms</subject><subject>Approximation</subject><subject>Combinatorics</subject><subject>Convex and Discrete Geometry</subject><subject>Fault tolerance</subject><subject>Mathematical analysis</subject><subject>Mathematical Modeling and Industrial Mathematics</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Rounding</subject><subject>Site selection</subject><subject>Theory of Computation</subject><issn>1382-6905</issn><issn>1573-2886</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9kE9LxDAQxYMouK5-AU8Fz9FJ0jbpcVn8Bwte9BySbLrbJW1qkqL77Y1W8OZp5sH7DW8eQtcEbgkAv4sEBBcYaImBEKgxnKAFqTjDVIj6NO9MUFw3UJ2jixgPAJD3coHMahyD_-x6lTo_FMrtfOjSvo9F60OR9rZo1eQSTt7ZoIaUpelcl46F82ZmMq-d7YuPzBVx0r3fTk6FYrSDcqmz8RKdtcpFe_U7l-jt4f51_YQ3L4_P69UGG8oh4W1TacK3pdK1Ek1rWk2ZAs2BVZU2FdiG1ryqWcmEbUrDDG9IaVpgWuusBFuim_luTvQ-2ZjkwU8hh4iSNoySUjBOs4vOLhN8jMG2cgz5_XCUBOR3mXIuU-Yy5U-ZEjLEZihm87Cz4e_0P9QXP7p5nQ</recordid><startdate>20240301</startdate><enddate>20240301</enddate><creator>Guo, Yingying</creator><creator>Li, Qiaoliang</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0001-5428-4414</orcidid></search><sort><creationdate>20240301</creationdate><title>Approximation algorithms for the fault-tolerant facility location problem with submodular penalties</title><author>Guo, Yingying ; Li, Qiaoliang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c270t-d95b17d4ab6a89fcfb23a0b70355bc50e9267563438e94c3c7914cf03bbbc3c83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Approximation</topic><topic>Combinatorics</topic><topic>Convex and Discrete Geometry</topic><topic>Fault tolerance</topic><topic>Mathematical analysis</topic><topic>Mathematical Modeling and Industrial Mathematics</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Rounding</topic><topic>Site selection</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Guo, Yingying</creatorcontrib><creatorcontrib>Li, Qiaoliang</creatorcontrib><collection>CrossRef</collection><jtitle>Journal of combinatorial optimization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Guo, Yingying</au><au>Li, Qiaoliang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Approximation algorithms for the fault-tolerant facility location problem with submodular penalties</atitle><jtitle>Journal of combinatorial optimization</jtitle><stitle>J Comb Optim</stitle><date>2024-03-01</date><risdate>2024</risdate><volume>47</volume><issue>2</issue><artnum>14</artnum><issn>1382-6905</issn><eissn>1573-2886</eissn><abstract>This work is to discuss the fault-tolerant facility location problem with submodular penalties. We propose an LP-rounding 2.27-approximation algorithm, where every demand point
j
has a requirement that
t
j
distinct facilities serve it. This is the first constant performance guarantee known for this problem. In addition, we give an LP-rounding 2-approximation algorithm for the case where all requirements are the same.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10878-024-01106-0</doi><orcidid>https://orcid.org/0000-0001-5428-4414</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1382-6905 |
| ispartof | Journal of combinatorial optimization, 2024-03, Vol.47 (2), Article 14 |
| issn | 1382-6905 1573-2886 |
| language | eng |
| recordid | cdi_proquest_journals_2932148372 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Algorithms Approximation Combinatorics Convex and Discrete Geometry Fault tolerance Mathematical analysis Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations research Operations Research/Decision Theory Optimization Rounding Site selection Theory of Computation |
| title | Approximation algorithms for the fault-tolerant facility location problem with submodular penalties |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T06%3A15%3A34IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Approximation%20algorithms%20for%20the%20fault-tolerant%20facility%20location%20problem%20with%20submodular%20penalties&rft.jtitle=Journal%20of%20combinatorial%20optimization&rft.au=Guo,%20Yingying&rft.date=2024-03-01&rft.volume=47&rft.issue=2&rft.artnum=14&rft.issn=1382-6905&rft.eissn=1573-2886&rft_id=info:doi/10.1007/s10878-024-01106-0&rft_dat=%3Cproquest_cross%3E2932148372%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2932148372&rft_id=info:pmid/&rfr_iscdi=true |