15 search results - page 2 / 3 » Complexity of Minimal Tree Routing and Coloring |
SWAT
2004
Springer
13 years 11 months ago
2004
Springer
We consider delay management in railway systems. Given delayed trains, we want to find a waiting policy for the connecting trains minimizing the weighted total passenger delay. If...
JSAC
2006
13 years 5 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
ICCCN
2008
IEEE
13 years 12 months ago
2008
IEEE
—Most existing wireless ad hoc routing protocols rely upon the use of backward learning technique with explicit control messages to route packets. In this paper we propose a set ...
ISPD
2010
ACM
14 years 11 days ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
DAC
2009
ACM
14 years 6 months ago
2009
ACM
In double patterning lithography (DPL), coloring conflict and stitch minimization are the two main challenges. Post layout decomposition algorithm [1] [2]may not be enough to achi...