Tight Approximation for Unconstrained XOS Maximization

11/22/2018
by   Yasushi Kawase, et al.
0

A set function is called XOS if it can be represented by the maximum of additive functions, where a set function f is additive if f(X) = ∑_x ∈ Xf({x}) for each X. When such a representation is fixed, the number of additive functions to define the XOS function is called the width. In this paper, we study the problem of maximizing XOS functions in the value oracle model. The problem is trivial for the XOS functions of width 1 because they are just additive, but it is already nontrivial even when the width is restricted to 2. We show two types of tight bounds on polynomial-time approximability for this problem. First, in general, the approximation bound is between O(n) and Ω(n^1-ϵ) for any ϵ > 0, where n is the ground set size. Second, when the width of the input XOS functions is bounded by a constant k ≥ 2, the approximation bound is between k - 1 and k - 1 - ϵ for any ϵ > 0. In particular, we give a linear-time algorithm to find an exact maximizer of a given XOS function of width 2, while we show that any exact algorithm requires an exponential number of value oracle calls even when the width is restricted to 3.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2023

Stretch-width

We introduce a new parameter, called stretch-width, that we show sits st...
research
04/15/2022

Twin-width can be exponential in treewidth

For any small positive real ε and integer t > 1/ε, we build a graph with...
research
02/21/2023

New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth

We study the tractability of the maximum independent set problem from th...
research
07/04/2017

Supporting Ruled Polygons

We explore several problems related to ruled polygons. Given a ruling of...
research
11/10/2020

Expressiveness of Neural Networks Having Width Equal or Below the Input Dimension

The expressiveness of deep neural networks of bounded width has recently...
research
12/27/2022

FPT algoritms providing constant ratio approximation of hypertree width parameters for hypergraphs of bounded rank

We propose an algorithm whose input are parameters k and r and a hypergr...
research
08/15/2023

Enumerating Tarski fixed points on lattices of binary relations

We study the problem of enumerating Tarski fixed points, focusing on the...

Please sign up or login with your details

Forgot password? Click here to reset