scientific article; zbMATH DE number 7561398
From MaRDI portal
Publication:5091036
DOI10.4230/LIPIcs.ISAAC.2018.44MaRDI QIDQ5091036
Nate Veldt, Anthony Wirth, David F. Gleich
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1809.09493
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Approximation algorithms for the lower bounded correlation clustering problem ⋮ Graph Clustering in All Parameter Regimes ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
Cites Work
- Unnamed Item
- Correlation clustering
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- On the hardness of approximating Multicut and Sparsest-Cut
- Correlation clustering in general weighted graphs
- Clustering with qualitative information
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
- A Local-Search 2-Approximation for 2-Correlation-Clustering
- On the power of unique 2-prover 1-round games
- O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
- Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems
- Aggregating inconsistent information
- LP-based pivoting algorithm for higher-order correlation clustering
This page was built for publication:
