scientific article
From MaRDI portal
Publication:3002775
DOI10.4086/toc.2006.v002a013zbMath1213.68704OpenAlexW3036999547MaRDI QIDQ3002775
Ioannis Giotis, Venkatesan Guruswami
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2006.v002a013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes, $2$-Approximation algorithms for two graph clustering problems, Parameterized algorithms for min-max 2-cluster editing, Dynamics in network interaction games, Graph clustering with a constraint on cluster sizes, Approximation algorithms on \(k\)-correlation clustering, A randomized PTAS for the minimum consensus clustering with a fixed number of clusters, Unnamed Item, Characterization of 2-path signed network, Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions, On a semi-superwized graph clustering problem, APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM, A near-optimal adaptive algorithm for maximizing modularity in dynamic scale-free networks, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, A note on the inapproximability of correlation clustering, Fixed-parameter algorithms for cluster vertex deletion, Unnamed Item, Unnamed Item, Correlation clustering in data streams, Fixed-Parameter Algorithms for Cluster Vertex Deletion, The Branch and Cut Method for the Clique Partitioning Problem, MOLECULAR DYNAMICS APPROACH TO CORRELATION CLUSTERING
