Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems

@article{Karpinski2009LinearTA,
  title={Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems},
  author={Marek Karpinski and Warren Schudy},
  journal={Electron. Colloquium Comput. Complex.},
  year={2009},
  volume={15}
}
We design a linear time approximation scheme for the Gale-Berlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest Codeword Problem (NCP) and Unique Games Problem. Further applications include, among other things, finding a constrained form of matrix rigidity and maximum likelihood decoding of an error correcting code. As another application of our method we give the first linear time approximation schemes for correlation… Expand
Approximation complexity of Metric Dimension problem
We study the approximation complexity of the Metric Dimension problem in bounded degree, dense as well as in general graphs. For the general case, we prove that the Metric Dimension problem is notExpand
On Approximation Complexity of Metric Dimension Problem
TLDR
It is proved that the Metric Dimension problem is not approximable within (1-e)lnn for any e>0, unless NP⊆DTIME(nloglogn), and an approximation algorithm is given which matches the lower bound. Expand
A polynomial time approximation scheme for k-consensus clustering
TLDR
This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of clusters returned is bounded (by k), responding to the result that Consensus ClUSTering is APX-hard to approximate. Expand
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
TLDR
These results improve a long line of work on approximation algorithms for correlation clustering in complete graphs, previously culminating in a ratio of 2.5 by Ailon, Charikar and Newman. Expand
Exploiting Dense Structures in Parameterized Complexity
TLDR
This paper designs kernelization as well as parameterized algorithms on dense structures on everywhere dense graphs, and obtains linear vertex kernels for Edge-Disjoint Paths, Edge Odd Cycle Transversal, Minimum Bisection, d-Way Cut, Multiway Cut and Multicut. Expand
Approximation Schemes for Dense Variants of Feedback Arc Set , Correlation Clustering , and Other Fragile Min Constraint Satisfaction Problems
We study approximation schemes for various minimum (or maximum) constraint satisfaction problems (CSPs). We give the first polynomial time approximation schemes (PTASs) for the minimization problemsExpand
Improved Theoretical and Practical Guarantees for Chromatic Correlation Clustering
TLDR
This work presents a fast and easy-to-implement constant approximation framework for the correlation clustering problem to graphs in which the pairwise relations between objects are categorical instead of binary, and develops a linear programming-based algorithm that achieves an improved approximation ratio of 4.5. Expand
Improved Approximation Algorithms for Bipartite Correlation Clustering
TLDR
The analysis extends a method developed by Ailon, Charikar and Newman in 2008, where a randomized pivoting algorithm was analyzed for obtaining a 3-approximation algorithm for CC, and is presented, and the main contribution, is a simple randomized combinatorial algorithm. Expand
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems
We settle the approximability status of the Minimum Betweenness problem in tournaments by designing a polynomial time approximation scheme (PTAS). No constant factor approximation was previouslyExpand
An Improved Algorithm for Bipartite Correlation Clustering
TLDR
An improved factor 4 ap- proximation algorithm to Correlation Clustering is presented using a simple combinatorial algorithm which does not require solving large convex programs. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 36 REFERENCES
Approximating minimum unsatisfiability of linear equations
TLDR
It is shown that for any constant c there exists a randomized polynomial time algorithm that approximates the Minimum Unsatisfiability of Linear Equations (MIN-UNSATISFY for short), with n/(c log n) approximation ratio. Expand
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
TLDR
It is shown that result 2 also holds for the Shortest Lattice Vector Problem in the l norm, and for some of these problems the same result as above is proved, but for a larger factor such as 2 1 & = n or n. Expand
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut, graph bisection, graphExpand
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
TLDR
It is proved that the minimum satisfaction of dense instances of kSAT-formulas, and linear equations mod 2, Ek- LIN2, do have PTASs for any k, and the MIN-Ek-LIN2 problems are equivalent to the k-ary versions of the Nearest Codeword problem. Expand
Deterministic Approximation Algorithms for the Nearest Codeword Problem
TLDR
A deterministic polynomial time algorithm is presented that achieves a remoteness of ***(n logk / k ) for all k ≤ n /2 and motivates the remote point problem by relating it to both the nearest codeword problem and the matrix rigidity approach to circuit lower bounds in computational complexity theory. Expand
On the Hardness of Decoding the Gale–Berlekamp Code
TLDR
The Gale-Berlekamp code is the dual code of the binary product code in which the horizontal and vertical constituent codes are both the parity code and maximum-likelihood decoding for specific codes seems to be the first that shows hardness for a "natural" code. Expand
Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity
  • Satyanarayana V. Lokam
  • Mathematics, Computer Science
  • Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
TLDR
It is shown that the lower bound on a variant of rigidity implies lower bounds on size-depth tradeoffs for arithmetic circuits with bounded coefficients computing linear transformations, and this results complement and strengthen a result of Razborov. Expand
The correct solution to Berlekamp's switching game
TLDR
Berlekamp's switching game of n × n grids for n ⩾ 10 is looked at, and it is shown that the previous result for R 10 was incorrect, and that in fact R 10 = 35. Expand
Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity
TLDR
The rigidity of a matrix measures the number of entries that must be changed in order to reduce its rank below a certain value and it is shown that the lower bound on a variant of rigidity implies lower bounds on size?depth trade-offs for arithmetic circuits with bounded coefficients computing linear transformations. Expand
Random sampling and approximation of MAX-CSP problems
TLDR
A new efficient sampling method for approximating r-dimensional Maximum Constraint Satisfaction Problems, MAX-rCSP, on n variables up to an additive error εnr, which gives for the first time a polynomial in ε—1 bound on the sample size necessary to carry out the above approximation. Expand
...
1
2
3
4
...