Polynomial Time Approximation Schemes for Dense Instances of N P Hard Problems

Journal of Computer and System Sciences (Impact Factor: 1). 01/1999; 58(1):193-210. DOI: 10.1006/jcss.1998.1605
Source: CiteSeer

ABSTRACT 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 separation, minimumk-way cut with and without specified terminals, and maximum 3-satisfiability. By dense graphs we mean graphs with minimum degreeΩ(n), although our algorithms solve most of these problems so long as the average degree isΩ(n). Denseness for nongraph problems is defined similarly. The unified framework begins with the idea ofexhaustive sampling:picking a small random set of vertices, guessing where they go on the optimum solution, and then using their placement to determine the placement of everything else. The approach then develops into a PTAS for approximating certainsmoothinteger programs, where the objective function and the constraints are “dense” polynomials of constant degree.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The local Hamiltonian problem consists of estimating the ground-state energy (given by the minimum eigenvalue) of a local quantum Hamiltonian. First, we show the existence of a good product-state approximation for the ground-state energy of 2-local Hamiltonians with one or more of the following properties: (1) high degree, (2) small expansion, or (3) a ground state with sublinear entanglement with respect to some partition into small pieces. The approximation based on degree is a surprising difference between quantum Hamiltonians and classical CSPs (constraint satisfaction problems), since in the classical setting, higher degree is usually associated with harder CSPs. The approximation based on low entanglement, in turn, was previously known only in the regime where the entanglement was close to zero. Since the existence of a low-energy product state can be checked in NP, the result implies that any Hamiltonian used for a quantum PCP theorem should have: (1) constant degree, (2) constant expansion, (3) a "volume law" for entanglement with respect to any partition into small parts. Second, we show that in several cases, good product-state approximations not only exist, but can be found in polynomial time: (1) 2-local Hamiltonians on any planar graph, solving an open problem of Bansal, Bravyi, and Terhal, (2) dense k-local Hamiltonians for any constant k, solving an open problem of Gharibian and Kempe, and (3) 2-local Hamiltonians on graphs with low threshold rank, via a quantum generalization of a recent result of Barak, Raghavendra and Steurer. Our work introduces two new tools which may be of independent interest. First, we prove a new quantum version of the de Finetti theorem which does not require the usual assumption of symmetry. Second, we describe a way to analyze the application of the Lasserre/Parrilo SDP hierarchy to local quantum Hamiltonians.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Given a node-weighted graph G=(V,E) and an integer k, the k-edge-incident subgraph problem requires one to find a vertex set S@?V of maximum weight that covers at most k edges, and the minimum partial vertex cover problem requires one to find a set of k vertices that covers the minimum number of edges. These two problems are closely related to the well-studied densestk-subgraph problem, and are interesting on their own. In this paper, we study these two problems from an approximation point of view. We obtain the following results. 1.For the k-edge-incident subgraph problem, we present a (2+@e) approximation algorithm for any fixed @e>0, which improves the previous best approximation ratio of 3 and matches that of its unweighted version [O. Goldschmidt and D.S. Hochbaum, k-edge subgraph problems, Discrete Appl. Math. 74 (2) (1997) 159-169]. 2.For the minimum partial vertex cover problem, we give a 2-approximation algorithm. We then propose a polynomial-time approximation scheme (PTAS) for it on the class of everywhere-c-dense graphs on which many well-studied combinatorial problems have been investigated.
    Discrete Applied Mathematics 12/2013; 161(18):2985-2991. · 0.72 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider approximation schemes for the maximum constraint satisfaction problems and the maximum assignment problems. Though they are NP-Hard in general, if the instance is "dense" or "locally dense", then they are known to have approximation schemes that run in polynomial time or quasi-polynomial time. In this paper, we give a unified method of showing these approximation schemes based on the Sherali-Adams linear programming relaxation hierarchy. We also use our linear programming-based framework to show new algorithmic results on the optimization version of the hypergraph isomorphism problem.
    Proceedings of the 5th conference on Innovations in theoretical computer science; 01/2014

Full-text (2 Sources)

Available from
Jun 1, 2014