91 search results - page 12 / 19 » Routing Flow Through a Strongly Connected Graph |
TCAD
2008
13 years 7 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
FCT
2003
Springer
14 years 21 days ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
DMGT
2011
12 years 11 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
USS
2004
13 years 8 months ago
2004
We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding per...