Clustering with qualitative information
From MaRDI portal
Publication:2568462
DOI10.1016/j.jcss.2004.10.012zbMath1094.68075OpenAlexW2146081992MaRDI QIDQ2568462
Moses Charikar, Anthony Wirth, Venkatesan Guruswami
Publication date: 10 October 2005
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2004.10.012
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items
Grothendieck-Type Inequalities in Combinatorial Optimization, Fair correlation clustering with global and local guarantees, An improved approximation algorithm for capacitated correlation clustering problem, Approximation algorithm for min-max correlation clustering problem with outliers, Approximation algorithm for the capacitated correlation clustering problem with penalties, Approximation algorithms for two variants of correlation clustering problem, Almost envy-freeness for groups: improved bounds via discrepancy theory, Cluster Editing, The multi-multiway cut problem, A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph, Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds, Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?, Correlation clustering and two-edge-connected augmentation for planar graphs, Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem, Approximation algorithms for the lower bounded correlation clustering problem, Evaluating balancing on social networks through the efficient solution of correlation clustering problems, On the hardness of labeled correlation clustering problem: a parameterized complexity view, Design and analysis of bipartite experiments under a linear exposure-response model, Exact Algorithms for Cluster Editing: Evaluation and Experiments, A \(2k\) kernel for the cluster editing problem, Graph clustering with a constraint on cluster sizes, Experimental study of semi-supervised graph 2-clustering problem, Approximation algorithms on \(k\)-correlation clustering, A randomized PTAS for the minimum consensus clustering with a fixed number of clusters, A combinatorial multi-armed bandit approach to correlation clustering, Unnamed Item, A polyhedral study of lifted multicuts, Approximating sparse quadratic programs, Simple Iterative Heuristics for Correlation Clustering, A PTAS for the Cluster Editing Problem on Planar Graphs, An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming, Unnamed Item, Ensemble clustering using semidefinite programming with applications, Learning representations from dendrograms, Approximation algorithms for bounded degree phylogenetic roots, Additive approximation algorithms for modularity maximization, Finding the closest ultrametric, Tight bounds for parameterized complexity of cluster editing with a small number of clusters, On the approximation of correlation clustering and consensus clustering, Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions, Quadratic forms on graphs, On a semi-superwized graph clustering problem, APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM, Branch-and-cut approaches for \(p\)-cluster editing, Approximate association via dissociation, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, Clustering data that are graph connected, Algorithms and complexity results for labeled correlation clustering problem, Cluster editing: kernelization based on edge cuts, Exact algorithms for cluster editing: Evaluation and experiments, Unnamed Item, Branch-and-price for \(p\)-cluster editing, A note on the inapproximability of correlation clustering, Clustering with partial information, Clustering with Partial Information, Unnamed Item, Unnamed Item, Correlation clustering in general weighted graphs, Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs, Cluster Editing: Kernelization Based on Edge Cuts, LP-based pivoting algorithm for higher-order correlation clustering, Efficient algorithms for cluster editing, Correlation clustering in data streams, Cluster deletion on interval graphs and split related graphs, Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs, Closest 4-leaf power is fixed-parameter tractable, A more effective linear kernelization for cluster editing, Semi-supervised graph clustering: a kernel approach, Online clique clustering, The Branch and Cut Method for the Clique Partitioning Problem, A simple and improved parameterized algorithm for bicluster editing, Graph Clustering in All Parameter Regimes, On the approximability of the maximum agreement subtree and maximum compatible tree problems, A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis, MOLECULAR DYNAMICS APPROACH TO CORRELATION CLUSTERING, Approximation algorithms for the capacitated correlation clustering problem with penalties, Metric-Constrained Optimization for Graph Clustering Algorithms, A fast branching algorithm for cluster vertex deletion
Cites Work
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Correlation clustering
- Toward efficient agnostic learning
- An improved approximation algorithm of MULTIWAY CUT.
- Inapproximability results for set splitting and satisfiability problems with no mixed clauses
- Rounding algorithms for a geometric embedding of minimum multiway cut
- On the power of unique 2-prover 1-round games
- Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications
- Computing Phylogenetic Roots with Bounded Degrees and Errors
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Some optimal inapproximability results
- Algorithms - ESA 2003
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
