604 search results - page 11 / 121 » On the Complexity of the Maximum Cut Problem |
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
ICTAC
2005
Springer
14 years 1 months ago
2005
Springer
We present a new derivation of eļ¬cient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speciļ...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We present an efļ¬cient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
CATS
2008
13 years 9 months ago
2008
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
ā We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...