Sciweavers

425 search results - page 29 / 85
» Polynomial Factorization 1987-1991
Sort
View
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
14 years 7 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
FAW
2010
Springer
225views Algorithms» more  FAW 2010»
13 years 11 months ago
Computing Minimum Diameter Color-Spanning Sets
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
Rudolf Fleischer, Xiaoming Xu
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 11 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
STOC
1999
ACM
123views Algorithms» more  STOC 1999»
14 years 3 months ago
Covering Rectilinear Polygons with Axis-Parallel Rectangles
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
V. S. Anil Kumar, H. Ramesh
APPROX
2009
Springer
131views Algorithms» more  APPROX 2009»
14 years 5 months ago
An Approximation Scheme for Terrain Guarding
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R....