2899 search results - page 138 / 580 » Dynamic Trees in Practice |
ICCAD
2008
IEEE
14 years 6 months ago
2008
IEEE
— In today’s VLSI designs, there can be many blockages in a routing region. The obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem has become an important prob...
COCOA
2008
Springer
13 years 11 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
ALGORITHMICA
2010
13 years 9 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
JSAC
2006
13 years 9 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...
TCSV
2002
13 years 9 months ago
2002
Compressed video bitstreams require protection from channel errors in a wireless channel. The threedimensional (3-D) SPIHT coder has proved its efficiency and its real-time capabi...