982 search results - page 108 / 197 » Solving Steiner tree problems in graphs to optimality |
150
click to vote
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
110
Voted
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
138
Voted
IMCSIT
2010
14 years 10 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
108
Voted
ESA
2008
Springer
15 years 2 months ago
2008
Springer
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
ASPDAC
2008
ACM
15 years 2 months ago
2008
ACM
A two-stage optimization methodology is proposed to solve the fixed-outline floorplanning problem that is a global optimization problem for wirelength minimization. In the first st...