117 search results - page 3 / 24 » Routing on Trees via Matchings |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Almost all tree kernels proposed in the literature match substructures without taking into account their relative positioning with respect to one another. In this paper, we propos...
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
116
click to vote
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
TMC
2012
13 years 16 hour ago
2012
—This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative r...