182 search results - page 3 / 37 » Routing Tree Problems on Random Graphs |
FOCS
2007
IEEE
14 years 3 days ago
2007
IEEE
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
ALGORITHMICA
2008
13 years 5 months ago
2008
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
AAIM
2005
Springer
13 years 11 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
TCAD
2002
13 years 5 months ago
2002
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
GECCO
2007
Springer
13 years 12 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...