178 search results - page 17 / 36 » Martin's maximum revisited |
116
click to vote
MFCS
2001
Springer
15 years 2 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize amplitude of the electrical current through the diodes whic...
65
Voted
ISCAS
1995
IEEE
15 years 1 months ago
1995
IEEE
A new technique for designing an LC bandpass DeltaSigma modulator is presented. This method is based on pulse shaping of a DAC output signal such that one can realize a desired (a...
CCCG
2010
14 years 11 months ago
2010
A planar point set S is an (i, t) set of ghost chimneys if there exist lines H0, H1, . . . , Ht-1 such that the orthogonal projection of S onto Hj consists of exactly i + j distin...