411 search results - page 11 / 83 » A New Approach to the Rectilinear Steiner Tree Problem |
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
We present a new approach for the incorporation of shape information into a segmentation algorithm. Unlike previous approaches to the problem, our method requires no initializatio...
100
click to vote
ENDM
2010
14 years 11 months ago
2010
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
ISPD
1999
ACM
15 years 4 months ago
1999
ACM
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
ICDCS
1998
IEEE
15 years 3 months ago
1998
IEEE
This paper considers the problem of key agreement in a group setting with highly-dynamic group member population. A protocol suite, called CLIQUES, is developed by extending the w...
HM
2007
Springer
15 years 5 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...