Name
Abstract | ||
|---|---|---|
In this paper, we consider a variant of the facility location problem. Imagine the scenario where facilities are categorized into multiple types such as schools, hospitals, post offices, etc. and the cost of connecting a client to a facility is realized by the distance between them. Each client has a total budget on the distance she/he is willing to travel. The goal is to open the minimum number of facilities such that the aggregate distance of each client to multiple types is within her/his budget. This problem closely resembles to the set cover and r-domination problems. Here, we study this problem in different settings. Specifically, we present some positive and negative results in the general setting, where no assumption is made on the distance values. Then we show that better results can be achieved when clients and facilities lie in a metric space. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.4230/LIPIcs.ISAAC.2018.73 | ISAAC |
Field | DocType | Citations |
Discrete mathematics,Set cover problem,Computer science,Operations research,Facility location problem,Metric space,Local search (optimization) | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dimitris Fotakis | 1 | 570 | 59.07 |
| Laurent Gourvès | 2 | 241 | 30.97 |
| Claire Mathieu | 3 | 22 | 4.28 |
| Abhinav Srivastav | 4 | 1 | 1.39 |