29 search results - page 2 / 6 » Spectral bounds for the maximum cut problem |
ICDM
2008
IEEE
13 years 11 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
WEA
2007
Springer
13 years 11 months ago
2007
Springer
The degree-constrained minimum spanning tree (DCMST) is relevant in the design of networks. It consists of finding a spanning tree whose nodes do not exceed a given maximum degree...
TIT
2011
12 years 11 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...