Correlation clustering in general weighted graphs
From MaRDI portal
Publication:2503347
DOI10.1016/j.tcs.2006.05.008zbMath1099.68074OpenAlexW1985875030MaRDI QIDQ2503347
Dotan Emanuel, Erik D. Demaine, Nicole Immorlica, Amos Fiat
Publication date: 14 September 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.05.008
Related Items
Multicuts and perturb \& MAP for probabilistic graph clustering, The Boolean quadratic programming problem with generalized upper bound constraints, Approximation algorithms for two variants of correlation clustering problem, Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints, 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, Correlation clustering and two-edge-connected augmentation for planar graphs, Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem, A modeling and computational study of the frustration index in signed networks, 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, Clustering and outlier detection using isoperimetric number of trees, Approximation algorithms on \(k\)-correlation clustering, Efficient enumeration of the optimal solutions to the correlation clustering problem, A combinatorial multi-armed bandit approach to correlation clustering, Unnamed Item, Shift of pairwise similarities for data clustering, A polyhedral study of lifted multicuts, Approximating sparse quadratic programs, Clustering heterogeneous financial networks, Unnamed Item, Learning representations from dendrograms, Algorithm for quadratic semi-assignment problem with partition size coefficients, Finding the closest ultrametric, Complexity of the cluster deletion problem on subclasses of chordal graphs, Unnamed Item, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, Algorithms and complexity results for labeled correlation clustering problem, Unnamed Item, Clustering with partial information, Clustering with Partial Information, Unnamed Item, Unnamed Item, Constant ratio fixed-parameter approximation of the edge multicut problem, LP-based pivoting algorithm for higher-order correlation clustering, Correlation clustering in data streams, Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs, Graph Clustering in All Parameter Regimes, A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis, Neighborhood hypergraph model for topological data analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs
- Correlation clustering
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- Clustering with qualitative information
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Clustering for edge-cost minimization (extended abstract)
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A Survey of Recent Advances in Hierarchical Clustering Algorithms
- The Complexity of Multiterminal Cuts
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Excluded minors, network decomposition, and multicommodity flow
- Multi-Commodity Network Flows
- Algorithms - ESA 2003
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
