Results 1  10
of
51
Clustering with qualitative information
 In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
, 2003
"... We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla [1] cast the problem thus: given a graph G whose edges are labeled “+ ” (similar) or “− ” (dissimilar), partition the vertices into clusters so that ..."
Abstract

Cited by 123 (9 self)
 Add to MetaCart
(Show Context)
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla [1] cast the problem thus: given a graph G whose edges are labeled “+ ” (similar) or “− ” (dissimilar), partition the vertices into clusters so that the number of pairs correctly (resp. incorrectly) classified with respect to the input labeling is maximized (resp. minimized). Complete graphs, where the classifier labels every edge, and general graphs, where some edges are not labeled, are both worth studying. We answer several questions left open in [1] and provide a sound overview of clustering with qualitative information. We give a factor 4 approximation for minimization on complete graphs, and a factor O(log n) approximation for general graphs. For the maximization version, a PTAS for complete graphs is shown in [1]; we give a factor 0.7664 approximation for general graphs, noting that a PTAS is unlikely by proving APXhardness. We also prove the APXhardness of minimization on complete graphs. 1.
Approximation algorithms for the 0extension problem
 IN PROCEEDINGS OF THE TWELFTH ANNUAL ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 2001
"... In the 0extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes to terminals so as to minimize the sum, over all edges, of the product of the edge’s weight and the distance between t ..."
Abstract

Cited by 70 (3 self)
 Add to MetaCart
(Show Context)
In the 0extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes to terminals so as to minimize the sum, over all edges, of the product of the edge’s weight and the distance between the terminals to which its endpoints are assigned. This problem generalizes the multiway cut problem of Dahlhaus, Johnson, Papadimitriou, Seymour, and Yannakakis and is closely related to the metric labeling problem introduced by Kleinberg and Tardos. We present approximation algorithms for 0Extension. In arbitrary graphs, we present a O(log k)approximation algorithm, k being the number of terminals. We also give O(1)approximation guarantees for weighted planar graphs. Our results are based on a natural metric relaxation of the problem, previously considered by Karzanov. It is similar in flavor to the linear programming relaxation of Garg, Vazirani, and Yannakakis for the multicut problem and similar to relaxations for other graph partitioning problems. We prove that the integrality ratio of the metric relaxation is at least c √ lg k for a positive c for infinitely many k. Our results improve some of the results of Kleinberg and Tardos and they further our understanding on how to use metric relaxations.
Approximate Classification via Earthmover Metrics
 In SODA ’04: Proceedings of the fifteenth annual ACMSIAM symposium on Discrete algorithms
, 2004
"... Given a metric space (X, d), a natural distance measure on probability distributions over X is the earthmover metric. We use randomized rounding of earthmover metrics to devise new approximation algorithms for two wellknown classification problems, namely, metric labeling and 0extension. ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
Given a metric space (X, d), a natural distance measure on probability distributions over X is the earthmover metric. We use randomized rounding of earthmover metrics to devise new approximation algorithms for two wellknown classification problems, namely, metric labeling and 0extension.
Fast Approximation Algorithms for Cutbased Problems in Undirected Graphs
"... We present a general method of designing fast approximation algorithms for cutbased minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees, allows approximating it almost as quickly on general graphs wh ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
We present a general method of designing fast approximation algorithms for cutbased minimization problems in undirected graphs. In particular, we develop a technique that given any such problem that can be approximated quickly on trees, allows approximating it almost as quickly on general graphs while only losing a polylogarithmic factor in the approximation guarantee. To illustrate the applicability of our paradigm, we focus our attention on the undirected sparsest cut problem with general demands and the balanced separator problem. By a simple use of our framework, we obtain polylogarithmic approximation algorithms for these problems that run in time close to linear. The main tool behind our result is an efficient procedure that decomposes general graphs into simpler ones while approximately preserving the cutflow structure. This decomposition is inspired by the cutbased graph decomposition of Räcke that was developed in the context of oblivious routing schemes, as well as, by the construction of the ultrasparsifiers due to Spielman and Teng that was employed to preconditioning symmetric diagonallydominant matrices. 1
Multiway cuts in node weighted graphs
 JOURNAL OF ALGORITHMS
, 2004
"... A (2 — 2/k) approximation algorithm is presented for the node multiway cut problem, thus matching the result of Dahlhaus et al. (SIAM J. Comput. 23 (4) (1994) 864894) for the edge version of this problem. This is done by showing that the associated LPrelaxation always has a halfintegral optimal s ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
(Show Context)
A (2 — 2/k) approximation algorithm is presented for the node multiway cut problem, thus matching the result of Dahlhaus et al. (SIAM J. Comput. 23 (4) (1994) 864894) for the edge version of this problem. This is done by showing that the associated LPrelaxation always has a halfintegral optimal solution.
The hardness of metric labeling
 IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS’04
, 2004
"... The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels and a weighted graph. Additionally, a metric distance function on the labels is defined, and for each label and each verte ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels and a weighted graph. Additionally, a metric distance function on the labels is defined, and for each label and each vertex, an assignment cost is given. The goal is to find a minimumcost assignment of the vertices to the labels. The cost of the solution consists of two parts: the assignment costs of the vertices and the separation costs of the edges (each edge pays its weight times the distance between the two labels to which its endpoints are assigned). Due to the simple structure and variety of the applications, the problem and its special cases (with various distance functions on the labels) have recently received much attention. Metric Labeling has a known logarithmic approximation, and it has been an open question for several years whether a constant approximation exists. We refute this possibility and show that no constant approximation can be obtained for the problem unless P=NP, and we also show that the problem ishard to approximate, unless NP has quasipolynomial time algorithms.
On the unique games conjecture
 In FOCS
, 2005
"... This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry. 1 ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
(Show Context)
This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry. 1
Minmax graph partitioning and small set expansion
, 2011
"... We study graph partitioning problems from a minmax perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are: (i) the k parts need to be of equal s ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We study graph partitioning problems from a minmax perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are: (i) the k parts need to be of equal size, and (ii) the parts must separate a set of k given terminals. We consider a common generalization of these two problems, and design for it an O ( √ log n log k)approximation algorithm. This improves over an O(log 2 n) approximation for the second version due to Svitkina and Tardos [22], and roughly O(k log n) approximation for the first version that follows from other previous work. We also give an improved O(1)approximation algorithm for graphs that exclude any fixed minor. Our algorithm uses a new procedure for solving the SmallSet Expansion problem. In this problem, we are given a graph G and the goal is to find a nonempty set S ⊆ V of size S  ≤ ρn with minimum edgeexpansion. We give an O ( √ log n log (1/ρ)) bicriteria approximation algorithm for the general case of SmallSet Expansion, and O(1) approximation algorithm for graphs that exclude any fixed minor.
FixedParameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
"... Given a directed graph G, a set of k terminals and an integer p, the DIRECTED VERTEX MULTIWAY CUT problem asks if there is a set S of at most p (nonterminal) vertices whose removal disconnects each terminal from all other terminals. DIRECTED EDGE MULTIWAY CUT is the analogous problem where S is a se ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
(Show Context)
Given a directed graph G, a set of k terminals and an integer p, the DIRECTED VERTEX MULTIWAY CUT problem asks if there is a set S of at most p (nonterminal) vertices whose removal disconnects each terminal from all other terminals. DIRECTED EDGE MULTIWAY CUT is the analogous problem where S is a set of at most p edges. These two problems indeed are known to be equivalent. A natural generalization of the multiway cut is the multicut problem, in which we want to disconnect only a set of k given pairs instead of all pairs. Marx (Theor. Comp. Sci. 2006) showed that in undirected graphs multiway cut is fixedparameter tractable (FPT) parameterized by p. Marx and Razgon (STOC 2011) showed that undirected multicut is FPT and directed multicut is W[1]hard parameterized by p. We complete the picture here by our main result which is that both DIRECTED VERTEX MULTIWAY CUT and DIRECTED EDGE MULTIWAY CUT can be solved in time 22O(p) nO(1) , i.e., FPT parameterized by size p of the cutset of the solution. This answers an open question raised by Marx (Theor. Comp. Sci. 2006) and Marx and Razgon (STOC 2011). It follows from our result that DIRECTED MULTICUT is FPT for the case of k = 2 terminal pairs, which answers another open problem raised in Marx and Razgon (STOC 2011). 1