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

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

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.

  • [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.68 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the following clustering problem: we have a complete graph on n vertices (items), where each edge (u, v) is labeled either + or − depending on whether u and v have been deemed to be similar or different. The goal is to produce a partition of the vertices (a clustering) that agrees as much as possible with the edge labels. That is, we want a clustering that maximizes the number of + edges within clusters, plus the number of − edges between clusters (equivalently, minimizes the number of disagreements: the number of − edges inside clusters plus the number of + edges between clusters). This formulation is motivated from a document clustering problem in which one has a pairwise similarity function f learned from past data, and the goal is to partition the current set of documents in a way that correlates with f as much as possible; it can also be viewed as a kind of “agnostic learning” problem.An interesting feature of this clustering formulation is that one does not need to specify the number of clusters k as a separate parameter, as in measures such as k-median or min-sum or min-max clustering. Instead, in our formulation, the optimal number of clusters could be any value between 1 and n, depending on the edge labels. We look at approximation algorithms for both minimizing disagreements and for maximizing agreements. For minimizing disagreements, we give a constant factor approximation. For maximizing agreements we give a PTAS, building on ideas of Goldreich, Goldwasser, and Ron (1998) and de la Veg (1996). We also show how to extend some of these results to graphs with edge labels in [−1, +1], and give some results for the case of random noise.
    Machine Learning 01/2004; 56. · 1.69 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We present a unified framework on the limits of \emph{constraint satisfaction problems} (CSPs) and efficient parameter testing which depends only on array exchangeability and the method of cut decomposition without recourse to the weakly regular partitions. In particular, we formulate and prove a representation theorem for compact colored $r$-uniform directed hypergraph ($r$-graph) limits, and apply this to $r$CSP limits. We investigate the sample complexity of testable $r$-graph parameters, we discuss the generalized ground state energies and demonstrate that they are efficiently testable.

Full-text (2 Sources)

Available from
Jun 1, 2014