982 search results - page 89 / 197 » Solving Steiner tree problems in graphs to optimality |
117
Voted
SIAMDM
2010
14 years 7 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
110
Voted
ASPDAC
1998
ACM
15 years 5 months ago
1998
ACM
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
115
Voted
ATMOS
2010
14 years 11 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
105
click to vote
IPL
1998
15 years 11 days ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
126
click to vote
ECCV
2002
Springer
16 years 2 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...