701 search results - page 26 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
103
click to vote
ICCAD
2006
IEEE
16 years 7 days ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
117
Voted
GLVLSI
2003
IEEE
15 years 8 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
132
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
105
Voted
ESA
2007
Springer
15 years 9 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...
146
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...