7930 search results - page 1289 / 1586 » Greedy in Approximation Algorithms |
142
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
164
Voted
IMR
2003
Springer
15 years 10 months ago
2003
Springer
Motivated by Lagrangian simulation of elastic deformation, we propose a new tetrahedral mesh generation algorithm that produces both high quality elements and a mesh that is well ...
181
Voted
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
157
click to vote
GLVLSI
2002
IEEE
15 years 10 months ago
2002
IEEE
We present a low-power sine-output Direct Digital Frequency Synthesizer (DDFS) realized in 0.18 µm CMOS that achieves 60 dBc spectral purity from DC to the Nyquist frequency. No ...
132
click to vote
ICPPW
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...