604 search results - page 84 / 121 » On the Complexity of the Maximum Cut Problem |
JGAA
2006
14 years 9 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
102
click to vote
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
Distributed Constraint Optimization (DCOP) is a general framework that can model complex problems in multi-agent systems. Several current algorithms that solve general DCOP instan...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
77
Voted
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper studies the problem of energy conservation of mobile terminals in a multi-cell TDMA network supporting real-time sessions. The corresponding optimization problem involv...
101
click to vote
IWCMC
2006
ACM
15 years 3 months ago
2006
ACM
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...