2000•Memorandum - Technische Hogeschool Twente, Onderafdeling der Toegepaste WiskundeRequires access

An approximation algorithm for the 2-level uncapacitated facility location problem

Adriana F. Bumb

Abstract

We present an approximation algorithm for the maximization version of the two level uncapacitated facility location problem achieving a performance guarantee of $0.47.$ The main idea is to reduce the problem to a special case of MAX SAT, for which an approximation algorithm based on randomized rounding is presented.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Facility location problem, Approximation algorithm, Randomized rounding, Rounding, Mathematical optimization, Maximization, Computer science, Algorithm