Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/353457
Type: Artigo
Title: A PTAS for the geometric connected facility location problem
Author: Miyazawa, Flávio K.
Pedrosa, Lehilton L. C.
Schouery, Rafael C. S.
Souza, Renata G. D. de
Abstract: We consider the Geometric Connected Facility Location Problem (GCFLP): given a set of clients C⊂ ℝd, one wants to select a set of locations F⊂ ℝd where to open facilities, each at a fixed cost f≥0. For each client j∈ C, one has to choose to either connect
Subject: Teoria da aproximação
Teoria da computação
Algoritmos de aproximação
Approximation theory
Theory of computing
Approximation algorithms
Country: Estados Unidos
Editor: Springer
Rights: fechado
Identifier DOI: 10.1007/s00224-017-9749-x
Address: https://link.springer.com/article/10.1007/s00224-017-9749-x
Date Issue: 2017
Appears in Collections:IC - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-85011705856.pdf748.02 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.