you're reading...

SACT Seminar: The Maximum Facility Location Problem

Time: 1:00pm Tuesday, 8th September. Location: SIT 459 Speaker: Mitchell Jones, University of Sydney Title: The Maximum Facility Location Problem Abstract: In the maximum facility location problem, we are given a set of clients and facilities. Assigning a client to a facility incurs a cost and each facility has an associated interval on the real line. Our goal is to assign as many clients to open facilities in order to maximise the cost of assignment. Open facilities cannot have their respective intervals overlap. In this talk we look at two new approximation algorithms for this problem that use LP-rounding techniques. The first is 0.19-approximation algorithm, and the second is a randomised rounding algorithm



No comments yet.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 68 other followers

%d bloggers like this: