3475 search results - page 282 / 695 » Backbones in Optimization and Approximation |
144
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
177
click to vote
TCS
2008
15 years 6 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
137
click to vote
TCS
2008
15 years 6 months ago
2008
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...
162
click to vote
JSCIC
2007
15 years 6 months ago
2007
We consider a discontinuous Galerkin finite element method for the advection–reaction equation in two space–dimensions. For polynomial approximation spaces of degree greater t...
168
click to vote
VLSID
2004
IEEE
16 years 7 months ago
2004
IEEE
We consider the problem of minimizing the delay in signal transmission over point-to-point connections across multiple metal layers in a VLSI circuit. We present an exact solution...