FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2235001037> ?p ?o ?g. }

• W2235001037 endingPage "83" @default.
• W2235001037 startingPage "53" @default.
• W2235001037 abstract "In this paper, we consider the Unsplittable (hard) Capacitated Facility Location Problem (UCFLP) with uniform capacities and present new approximation algorithms for it. This problem is a generalization of the classical facility location problem where each facility can serve at most u units of demand and each client must be served by exactly one facility. This problem is motivated by its applications in many practical problems including supply chain problems of indivisible goods (Verter in Foundations of location analysis, chapter 2. International series in operations research and management science. Springer, Berlin, 2011) and the assignment problem in the content distribution networks (Bateni and Hajiaghayi in Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, pp 805–814, 2009). While there are several approximation algorithms for the soft capacitated version of this problem (in which one can open multiple copies of each facility) or the splittable version (in which the demand of each client can be divided to be served by multiple open facilities), there are very few results for the UCFLP. It is known that it is NP-hard to approximate this problem within any factor without violating the capacities. So we consider bicriteria $$(alpha ,beta )$$ -approximations where the algorithm returns a solution whose cost is within factor $$alpha $$ of the optimum and violates the capacity constraints within factor $$beta $$ . Shmoys et al. (Proceedings of the twenty-ninth annual ACM symposium on theory of computing, pp 265–274, 1997) were the first to consider this problem and gave a (9, 4)-approximation. Later results imply (O(1), 2)-approximations, however, no constant factor approximation is known with capacity violation of less than 2. We present a framework for designing bicriteria approximation algorithms for this problem and show two new approximation algorithms with factors (9, 3 / 2) and (29.315, 4 / 3). These are the first algorithms with constant approximation in which the violation of capacities is below 2. The heart of our algorithm is a reduction from the UCFLP to a restricted version of the problem. One feature of this reduction is that any $$(O(1),1+{epsilon })$$ -approximation for the restricted version implies an $$(O(1),1+{epsilon })$$ -approximation for the UCFLP and we believe our techniques might be useful towards finding such approximations or perhaps $$(f({epsilon }),1+{epsilon })$$ -approximation for the UCFLP for some function f. In addition, we present a quasi-polynomial time $$(1+epsilon ,1+epsilon )$$ -approximation for the (uniform) UCFLP in Euclidean metrics, for any constant $${epsilon }>0$$ ." @default.
• W2235001037 created "2016-06-24" @default.
• W2235001037 creator A5010339836 @default.
• W2235001037 creator A5025880780 @default.
• W2235001037 creator A5037762121 @default.
• W2235001037 date "2015-06-05" @default.
• W2235001037 modified "2023-09-23" @default.
• W2235001037 title "New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem" @default.
• W2235001037 cites W1508746608 @default.
• W2235001037 cites W1516365398 @default.
• W2235001037 cites W1556911662 @default.
• W2235001037 cites W1559577696 @default.
• W2235001037 cites W1606599877 @default.
• W2235001037 cites W1696776098 @default.
• W2235001037 cites W1854155592 @default.
• W2235001037 cites W1891203375 @default.
• W2235001037 cites W1966016308 @default.
• W2235001037 cites W1977541023 @default.
• W2235001037 cites W1991407520 @default.
• W2235001037 cites W2006514056 @default.
• W2235001037 cites W2010410498 @default.
• W2235001037 cites W2014369282 @default.
• W2235001037 cites W2037643332 @default.
• W2235001037 cites W2041571997 @default.
• W2235001037 cites W2076746184 @default.
• W2235001037 cites W2082353536 @default.
• W2235001037 cites W2106850014 @default.
• W2235001037 cites W2109549136 @default.
• W2235001037 cites W2110367141 @default.
• W2235001037 cites W2112539464 @default.
• W2235001037 cites W2123068254 @default.
• W2235001037 cites W2144926522 @default.
• W2235001037 cites W2145028977 @default.
• W2235001037 cites W2157424698 @default.
• W2235001037 cites W4232384064 @default.
• W2235001037 cites W4232911940 @default.
• W2235001037 cites W58289331 @default.
• W2235001037 doi "https://doi.org/10.1007/s00453-015-0012-z" @default.
• W2235001037 hasPublicationYear "2015" @default.
• W2235001037 type Work @default.
• W2235001037 sameAs 2235001037 @default.
• W2235001037 citedByCount "7" @default.
• W2235001037 countsByYear W22350010372012 @default.
• W2235001037 countsByYear W22350010372014 @default.
• W2235001037 countsByYear W22350010372018 @default.
• W2235001037 countsByYear W22350010372019 @default.
• W2235001037 countsByYear W22350010372022 @default.
• W2235001037 crossrefType "journal-article" @default.
• W2235001037 hasAuthorship W2235001037A5010339836 @default.
• W2235001037 hasAuthorship W2235001037A5025880780 @default.
• W2235001037 hasAuthorship W2235001037A5037762121 @default.
• W2235001037 hasBestOaLocation W22350010372 @default.
• W2235001037 hasConcept C108005400 @default.
• W2235001037 hasConcept C108713360 @default.
• W2235001037 hasConcept C11413529 @default.
• W2235001037 hasConcept C126255220 @default.
• W2235001037 hasConcept C134306372 @default.
• W2235001037 hasConcept C148764684 @default.
• W2235001037 hasConcept C177148314 @default.
• W2235001037 hasConcept C17744445 @default.
• W2235001037 hasConcept C199539241 @default.
• W2235001037 hasConcept C24858836 @default.
• W2235001037 hasConcept C33923547 @default.
• W2235001037 hasConcept C41008148 @default.
• W2235001037 hasConcept C44104985 @default.
• W2235001037 hasConceptScore W2235001037C108005400 @default.
• W2235001037 hasConceptScore W2235001037C108713360 @default.
• W2235001037 hasConceptScore W2235001037C11413529 @default.
• W2235001037 hasConceptScore W2235001037C126255220 @default.
• W2235001037 hasConceptScore W2235001037C134306372 @default.
• W2235001037 hasConceptScore W2235001037C148764684 @default.
• W2235001037 hasConceptScore W2235001037C177148314 @default.
• W2235001037 hasConceptScore W2235001037C17744445 @default.
• W2235001037 hasConceptScore W2235001037C199539241 @default.
• W2235001037 hasConceptScore W2235001037C24858836 @default.
• W2235001037 hasConceptScore W2235001037C33923547 @default.
• W2235001037 hasConceptScore W2235001037C41008148 @default.
• W2235001037 hasConceptScore W2235001037C44104985 @default.
• W2235001037 hasIssue "1" @default.
• W2235001037 hasLocation W22350010371 @default.
• W2235001037 hasLocation W22350010372 @default.
• W2235001037 hasOpenAccess W2235001037 @default.
• W2235001037 hasPrimaryLocation W22350010371 @default.
• W2235001037 hasRelatedWork W1964276725 @default.
• W2235001037 hasRelatedWork W1987959344 @default.
• W2235001037 hasRelatedWork W2032958993 @default.
• W2235001037 hasRelatedWork W2034619144 @default.
• W2235001037 hasRelatedWork W2057791178 @default.
• W2235001037 hasRelatedWork W2069105809 @default.
• W2235001037 hasRelatedWork W2083833523 @default.
• W2235001037 hasRelatedWork W2147879413 @default.
• W2235001037 hasRelatedWork W2762633139 @default.
• W2235001037 hasRelatedWork W2805325553 @default.
• W2235001037 hasVolume "75" @default.
• W2235001037 isParatext "false" @default.
• W2235001037 isRetracted "false" @default.
• W2235001037 magId "2235001037" @default.
• W2235001037 workType "article" @default.