Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

DOI10.1007/b11961zbMath1202.68479OpenAlexW4298253479MaRDI QIDQ5900917

Erik D. Demaine, Nicole Immorlica

Publication date: 26 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11961

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

The multi-multiway cut problem, 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, Simple Iterative Heuristics for Correlation Clustering, Finding the closest ultrametric, On the approximation of correlation clustering and consensus clustering, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, A note on the inapproximability of correlation clustering, Clustering with partial information, Clustering with Partial Information, Correlation clustering in general weighted graphs, Semi-supervised graph clustering: a kernel approach, Online clique clustering, A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis, Unnamed Item, Clustering with qualitative information, Metric-Constrained Optimization for Graph Clustering Algorithms