Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Facility Location Problem with Capacity Constraints: Algorithmic and
  Mechanism Design Perspectives   We consider the facility location problem in the one-dimensional setting
where each facility can serve a limited number of agents from the algorithmic
and mechanism design perspectives. From the algorithmic perspective, we prove
that the corresponding optimization problem, where the goal is to locate
facilities to minimize either the total cost to all agents or the maximum cost
of any agent is NP-hard. However, we show that the problem is fixed-parameter
tractable, and the optimal solution can be computed in polynomial time whenever
the number of facilities is bounded, or when all facilities have identical
capacities. We then consider the problem from a mechanism design perspective
where the agents are strategic and need not reveal their true locations. We
show that several natural mechanisms studied in the uncapacitated setting
either lose strategyproofness or a bound on the solution quality for the total
or maximum cost objective. We then propose new mechanisms that are
strategyproof and achieve approximation guarantees that almost match the lower
bounds.

23
The categories of this paper are: solv-int
21
The categories of this paper are: adap-org
13
The categories of this paper are: quant-ph
25
The categories of this paper are: patt-sol
36
The categories of this paper are: cmp-lg
12
The categories of this paper are: nucl-th
24
The categories of this paper are: dg-ga
4
The categories of this paper are: cond-mat
32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
11
The categories of this paper are: hep-lat
29
The categories of this paper are: funct-an
16
The categories of this paper are: stat
0
The categories of this paper are: hep-ph
19
The categories of this paper are: eess
35
The categories of this paper are: mtrl-th