Pages that link to "Item:Q5900917"

The following pages link to Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900917):

Displaying 19 items.

• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters (Q418755) (← links)
• Finding the closest ultrametric (Q476304) (← links)
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
• The multi-multiway cut problem (Q884458) (← links)
• On the approximation of correlation clustering and consensus clustering (Q931713) (← links)
• A note on the inapproximability of correlation clustering (Q975483) (← links)
• Semi-supervised graph clustering: a kernel approach (Q1009309) (← links)
• A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis (Q2079285) (← links)
• Clustering with partial information (Q2268879) (← links)
• Online clique clustering (Q2300728) (← links)
• Correlation clustering in general weighted graphs (Q2503347) (← links)
• Clustering with qualitative information (Q2568462) (← links)
• Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (Q2947231) (← links)
• Clustering with Partial Information (Q3599122) (← links)
• Metric-Constrained Optimization for Graph Clustering Algorithms (Q5025762) (← links)
• Simple Iterative Heuristics for Correlation Clustering (Q5116365) (← links)
• (Q5149219) (← links)
• Approximation algorithms on \(k\)-correlation clustering (Q6151012) (← links)
• Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs (Q6573407) (← links)