39 research outputs found
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
Parameterization and approximation are two popular ways of coping with
NP-hard problems. More recently, the two have also been combined to derive many
interesting results. We survey developments in the area both from the
algorithmic and hardness perspectives, with emphasis on new techniques and
potential future research directions
Parameterized Inapproximability of Independent Set in -Free Graphs
We study the Independent Set (IS) problem in -free graphs, i.e., graphs
excluding some fixed graph as an induced subgraph. We prove several
inapproximability results both for polynomial-time and parameterized
algorithms.
Halld\'orsson [SODA 1995] showed that for every IS has a
polynomial-time -approximation in -free
graphs. We extend this result by showing that -free graphs admit a
polynomial-time -approximation, where is the
size of a maximum independent set in . Furthermore, we complement the result
of Halld\'orsson by showing that for some there is
no polynomial-time -approximation for these graphs, unless NP = ZPP.
Bonnet et al. [IPEC 2018] showed that IS parameterized by the size of the
independent set is W[1]-hard on graphs which do not contain (1) a cycle of
constant length at least , (2) the star , and (3) any tree with two
vertices of degree at least at constant distance.
We strengthen this result by proving three inapproximability results under
different complexity assumptions for almost the same class of graphs (we weaken
condition (2) that does not contain ). First, under the ETH, there
is no algorithm for any computable function .
Then, under the deterministic Gap-ETH, there is a constant such that
no -approximation can be computed in time. Also,
under the stronger randomized Gap-ETH there is no such approximation algorithm
with runtime .
Finally, we consider the parameterization by the excluded graph , and show
that under the ETH, IS has no algorithm in -free graphs
and under Gap-ETH there is no -approximation for -free
graphs with runtime .Comment: Preliminary version of the paper in WG 2020 proceeding
Tight Approximation Guarantees for Concave Coverage Problems
33 pages. v3 minor corrections and added FPT hardnessInternational audienceIn the maximum coverage problem, we are given subsets of a universe along with an integer and the objective is to find a subset of size that maximizes . It is a classic result that the greedy algorithm for this problem achieves an optimal approximation ratio of . In this work we consider a generalization of this problem wherein an element can contribute by an amount that depends on the number of times it is covered. Given a concave, nondecreasing function , we define , where . The standard maximum coverage problem corresponds to taking . For any such , we provide an efficient algorithm that achieves an approximation ratio equal to the Poisson concavity ratio of , defined by . Complementing this approximation guarantee, we establish a matching NP-hardness result when grows in a sublinear way. As special cases, we improve the result of [Barman et al., IPCO, 2020] about maximum multi-coverage, that was based on the unique games conjecture, and we recover the result of [Dudycz et al., IJCAI, 2020] on multi-winner approval-based voting for geometrically dominant rules. Our result goes beyond these special cases and we illustrate it with applications to distributed resource allocation problems, welfare maximization problems and approval-based voting for general rules
FPT-Algorithms for the l-Matchoid Problem with Linear and Submodular Objectives
We design a fixed-parameter deterministic algorithm for computing a maximum
weight feasible set under a -matchoid of rank , parameterized by
and . Unlike previous work that presumes linear representativity of
matroids, we consider the general oracle model. Our result, combined with the
lower bounds of Lovasz, and Jensen and Korte, demonstrates a separation between
the -matchoid and the matroid -parity problems in the setting of
fixed-parameter tractability.
Our algorithms are obtained by means of kernelization: we construct a small
representative set which contains an optimal solution. Such a set gives us much
flexibility in adapting to other settings, allowing us to optimize not only a
linear function, but also several important submodular functions. It also helps
to transform our algorithms into streaming algorithms.
In the streaming setting, we show that we can find a feasible solution of
value and the number of elements to be stored in memory depends only on
and but totally independent of . This shows that it is possible to
circumvent the recent space lower bound of Feldman et al., by parameterizing
the solution value. This result, combined with existing lower bounds, also
provides a new separation between the space and time complexity of maximizing
an arbitrary submodular function and a coverage function in the value oracle
model
LIPIcs, Volume 248, ISAAC 2022, Complete Volume
LIPIcs, Volume 248, ISAAC 2022, Complete Volum
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Volume 244, ESA 2022, Complete Volum