A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

@article{Arora1996ANR,
  title={A new rounding procedure for the assignment problem with applications to dense graph arrangement problems},
  author={Sanjeev Arora and Alan M. Frieze and Haim Kaplan},
  journal={Mathematical Programming},
  year={1996},
  volume={92},
  pages={1-36}
}
Abstract.We present a randomized procedure for rounding fractional perfect matchings to (integral) matchings. If the original fractional matching satisfies any linear inequality, then with high probability, the new matching satisfies that linear inequality in an approximate sense. This extends the well-known LP rounding procedure of Raghavan and Thompson, which is usually used to round fractional solutions of linear programs.¶We use our rounding procedure to design an additive approximation… 

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, graph

Dependent rounding and its applications to approximation algorithms

We develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to

Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm

We show that for every positive ϵ > 0, unless NP ⊂ BPQP, it is impossible to approximate the maximum quadratic assignment problem within a factor better than 2<sup>log<sup>1-ϵ</sup> <i>n</i></sup> by

On the Maximum Quadratic Assignment Problem

TLDR
An O(√n) approximation algorithm is given, which is the first non-trivial approximation guarantee for this problem, and improves over the previously bestknown approximation guarantee of 4 for this special case of Maximum Quadratic Assignment.

Multi-budgeted matchings and matroid intersection via dependent rounding

TLDR
It is shown that for any fixed Δ > 0, a given point x can be rounded to a random solution R such that E[1R] = (1 − Δ)x and any linear function of x satisfies dimension-free Chernoff-Hoeffding concentration bounds.

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems (Extended Version)

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,

Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems

TLDR
A unified method of showing approximation schemes based on the Sherali-Adams linear programming relaxation hierarchy to show new algorithmic results on the optimization version of the hypergraph isomorphism problem.

Approximating Layout Problems on Random Geometric Graphs

TLDR
This paper proves that some of the layout problems on a family of random geometric graphs remain NP-complete even for geometric graphs, and presents two heuristics that, almost surely, turn out to be constant approximation algorithms for their layout problems.

Concentration inequalities for nonlinear matroid intersection

TLDR
This work proves concentration inequalities for polynomial objective functions and constraints that has numerous applications and can be used in approximation algorithms for Minimum Quadratic Spanning Tree, Unrelated Parallel Machines Scheduling and scheduling with time windows and nonlinear objectives.

Generating Randomized Roundings with Cardinality Constraints and Derandomizations

TLDR
A simple O(mnlog n) time algorithm that works in the RAM model for arbitrary matrices with entries in ℚ≥0.5 improves over the O(MN2 log(mn) time solution of Srivastav and Stangier.
...

References

SHOWING 1-10 OF 36 REFERENCES

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, graph

The regularity lemma and approximation schemes for dense problems

  • A. FriezeR. Kannan
  • Mathematics
    Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
TLDR
The central point here is that the Regularity Lemma provides an explanation of why these Max-SNP hard problems turn out to be easy in dense graphs.

An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms

  • F. LeightonSatish Rao
  • Computer Science
    [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
  • 1988
TLDR
The main result is an algorithm for performing the task provided that the capacity of each cut exceeds the demand across the cut by a Theta (log n) factor.

An efficient approximation scheme for the one-dimensional bin-packing problem

  • N. KarmarkarR. Karp
  • Computer Science
    23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
  • 1982
TLDR
It is proved that the LP relaxation of bin packing, which was solved efficiently in practice by Gilmore and Gomory, has membership in P, despite the fact that it has an astronomically large number of variables.

Constructing a perfect matching is in random NC

We show that the problem of constructing a perfect matching in a graph is in the complexity class Random NC; i.e., the problem is solvable in polylog time by a randomized parallel algorithm using a

Probabilistic construction of deterministic algorithms: Approximating packing integer programs

  • P. Raghavan
  • Computer Science, Mathematics
    27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • 1986

Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs

  • N. AlonA. FriezeD. Welsh
  • Mathematics, Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
TLDR
A general technique is developed that supplies fully polynomial randomised approximation schemes for approximating the valve of T(G; x,, y) for any dense graph G, that is, any graph on n vertices whose minimum degree is /spl Omega/(n).

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

TLDR
An algorithm is presented which finds for any 0 < e < 1 an approximate solution P satisfying (P* P)/P* < ~, where P* is the desired optimal sum.

Polynomial time approximation schemes for Euclidean TSP and other geometric problems

  • Sanjeev Arora
  • Computer Science
    Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
TLDR
A polynomial time approximation scheme for Euclidean TSP in /spl Rfr//sup 2/ that finds a (1+/spl epsiv/)-approximation to the optimum traveling salesman tour in time n/sup 0(1//spl ePSiv/)/.

An approximation algorithm for the generalized assignment problem

The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing jobj on machinei