69 search results - page 9 / 14 » Terminal Steiner Tree with Bounded Edge Length |
126
click to vote
ISPD
1999
ACM
15 years 8 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...
120
click to vote
COCOON
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
166
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
133
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
113
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...