Property Testing of LP-Type Problems

by   Rogers Epstein, et al.

Given query access to a set of constraints S, we wish to quickly check if some objective function φ subject to these constraints is at most a given value k. We approach this problem using the framework of property testing where our goal is to distinguish the case φ(S) < k from the case that at least an ϵ fraction of the constraints in S need to be removed for φ(S) < k to hold. We restrict our attention to the case where (S, φ) are LP-Type problems which is a rich family of combinatorial optimization problems with an inherent geometric structure. By utilizing a simple sampling procedure which has been used previously to study these problems, we are able to create property testers for any LP-Type problem whose query complexities are independent of the number of constraints. To the best of our knowledge, this is the first work that connects the area of LP-Type problems and property testing in a systematic way. Among our results is a tight upper bound on the query complexity of testing clusterability with one cluster considered by Alon, Dar, Parnas, and Ron (FOCS 2000). We also supply a corresponding tight lower bound for this problem and other LP-Type problems using geometric constructions.


page 1

page 2

page 3

page 4


Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension

In this paper we present various distributed algorithms for LP-type prob...

Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem

We consider the integrality gap of the subtour LP relaxation of the Trav...

Tight Lower Bound on Equivalence Testing in Conditional Sampling Model

We study the equivalence testing problem where the goal is to determine ...

Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation

We consider the MAP-inference problem for graphical models, which is a v...

Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility

We study the Convex Set Disjointness (CSD) problem, where two players ha...

Efficient Algorithms for Global Inference in Internet Marketplaces

Matching demand to supply in internet marketplaces (e-commerce, ride-sha...

A Characterization of the Realizable Matoušek Unique Sink Orientations

The Matoušek LP-type problems were used by Matoušek to show that the Sha...

Please sign up or login with your details

Forgot password? Click here to reset