Algorithms - ESA 2003
From MaRDI portal
Publication:5897247
DOI10.1007/b13632zbMath1266.68228OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897247
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (13)
Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds ⋮ Approximation algorithms on \(k\)-correlation clustering ⋮ A randomized PTAS for the minimum consensus clustering with a fixed number of clusters ⋮ A polyhedral study of lifted multicuts ⋮ Simple Iterative Heuristics for Correlation Clustering ⋮ Finding the closest ultrametric ⋮ On the approximation of correlation clustering and consensus clustering ⋮ A note on the inapproximability of correlation clustering ⋮ Clustering with partial information ⋮ Clustering with Partial Information ⋮ Correlation clustering in general weighted graphs ⋮ Clustering with qualitative information ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms
This page was built for publication: Algorithms - ESA 2003
