688 search results - page 87 / 138 » General Partitioning on Random Graphs |
200
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
167
click to vote
CIAC
2006
Springer
15 years 9 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
126
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
160
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
168
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...