Metric Clustering via Consistent Labeling

First Page		Document Content
Date: 2010-09-28 14:30:42 Combinatorial optimization Operations research NP-complete problems Approximation algorithms Computational problems Linear programming Minimum k-cut Optimization problem Ear decomposition Decomposition method		Metric Clustering via Consistent Labeling Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 325,82 KB Share Document on Facebook

	Metric Clustering via Consistent Labeling DocID: 1pC6X - View Document
	Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro DocID: 17SAF - View Document
	Algorithms for Placing Monitors in a Flow Network (Preliminary Version) Francis Chin1, , Marek Chrobak2, , and Li Yan2, 1 DocID: 14vsc - View Document
	A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of DocID: 128pW - View Document
	INFORMS Journal on Computing informs Vol. 21, No. 4, Fall 2009, pp. 641–649 issn[removed] eissn[removed] 09 2104 0641 DocID: Nv1p - View Document