604 search results - page 4 / 121 » On the Complexity of the Maximum Cut Problem |
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We investigate a natural online version of the well-known Maximum Directed Cut problem on DAGs. We propose a deterministic algorithm and show that it achieves a competitive ratio o...
WG
2001
Springer
13 years 12 months ago
2001
Springer
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
STOC
1996
ACM
13 years 11 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...