Abstract
The k -Level Concentrator Location Problem is a variant of the k -Level Facility Location Problem, where in contrast to the classical model, service costs are charged only once and not proportional to the demand. We present a new approximation algorithm with a performance guarantee of 3 2 ( 3 k − 1 ) , improving over the 1.52 ⋅ 9 k − 1 -approximation algorithm proposed by Kantor and Peleg. Moreover, the analysis is considerably shortened by using complementary slackness conditions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
