TY - GEN A1 - Arulselvan, Ashwin A1 - Maurer, Olaf A1 - Skutella, Martin T1 - An incremental algorithm for the uncapacitated facility location problem N2 - We study the incremental facility location problem, wherein we are given an instance of the uncapacitated facility location problem. We seek an incremental sequence of opening facilities and an incremental sequence of serving customers along with their fixed assignments to facilities open in the partial sequence. Our aim is to have the solution obtained for serving the first l customers in the sequence be competitive with the optimal solution to serve any l customers. We provide an incremental framework that provides an overall competitive factor of 8 and a worst case instance that provides the lower bound of 3. The problem has applications in multi-stage network planning. KW - incremental algorithm, facility location problem, network design Y1 - 2013 UR - https://opus4.kobv.de/opus4-matheon/frontdoor/index/index/docId/1219 UR - https://nbn-resolving.org/urn:nbn:de:0296-matheon-12192 ER -