2137 search results - page 367 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
153
Voted
ALGOSENSORS
2009
Springer
15 years 6 days ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
113
click to vote
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euc...
114
click to vote
CEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
105
Voted
VLSID
2002
IEEE
16 years 2 months ago
2002
IEEE
Interconnect delay has become a critical factor in determining the performance of integrated circuits. Routing and buffering are powerful means of improving the circuit speed and ...
140
click to vote
TON
2008
15 years 2 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...