Minimum k-cut - PDFSEARCH.IO - Document Search Engine

Minimum k-cut
Results: 8

#	Item
1	Metric Clustering via Consistent Labeling Add to Reading List Source URL: theory.stanford.edu Language: English - 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
2	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 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:09:48 NP-complete problems Parameterized complexity Kernelization Vertex cover Graph coloring Minimum k-cut Algorithm Independent set Greedy algorithm Theoretical computer science Mathematics Computational complexity theory
3	Algorithms for Placing Monitors in a Flow Network (Preliminary Version) Francis Chin1, , Marek Chrobak2, , and Li Yan2, 1 Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2013-09-02 22:22:25 NP-complete problems Graph connectivity Graph Multigraph Bridge Minimum k-cut Line graph Graph coloring Graph theory Mathematics Theoretical computer science
4	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 Add to Reading List Source URL: tom.thesnail.org Language: English - Date: 2015-05-04 03:09:24 Approximation algorithms Cluster analysis Combinatorial optimization NP-complete problems Complexity classes Correlation clustering Consensus clustering Optimization problem Minimum k-cut Theoretical computer science Computational complexity theory Statistics
5	INFORMS Journal on Computing informs Vol. 21, No. 4, Fall 2009, pp. 641–649 issn[removed] eissn[removed] 09 2104 0641 Add to Reading List Source URL: mgoycool.uai.cl Language: English - Date: 2011-10-28 12:33:41 Combinatorial optimization Operations research NP-complete problems Cutting-plane method Linear programming Minimum k-cut Inequality Travelling salesman problem Floating point Mathematics Mathematical optimization Theoretical computer science
6	This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. IEEE TRANSACTIONS ON CLOUD COMPUTING 1 Greenhead: Virtual Da Add to Reading List Source URL: www.savinetwork.ca Language: English - Date: 2013-10-03 15:36:59 Computers and the environment Cloud computing Virtual machine Data center Internet backbone Green computing Carbon footprint Partition Minimum k-cut Computing System software Mathematics
7	Approximation and Hardness Results for Label Cut and Related Problems Peng Zhang ∗ Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2008-02-10 09:20:05 NP-complete problems Combinatorial optimization Maximum flow problem Graph coloring Cut Minimum k-cut Optimization problem Max-flow min-cut theorem Set cover problem Theoretical computer science Mathematics Graph theory
8	A Simple Min-Cut Algorithm MECHTHILD STOER Televerkets Forskningsinstitutt, Kjeller, Norway Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2005-01-20 14:41:23 Graph connectivity Maximum flow problem Network flow Cut Max-flow min-cut theorem Minimum cut Connectivity NP-complete problems K-edge-connected graph Graph theory Mathematics Combinatorial optimization