Sciweavers

144 search results - page 21 / 29
» A Polynomial Time Approximation Scheme for the Square Packin...
Sort
View
121
Voted
FOCS
2009
IEEE
15 years 10 months ago
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
Xi Chen, Decheng Dai, Ye Du, Shang-Hua Teng
148
Voted
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
15 years 5 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
115
Voted
DAC
2009
ACM
16 years 4 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...
137
Voted
TCS
2008
15 years 3 months ago
Minimum-Energy Broadcast and disk cover in grid wireless networks
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam ...
153
Voted
CAD
2004
Springer
15 years 3 months ago
Control point adjustment for B-spline curve approximation
Pottmann et al. propose an iterative optimization scheme for approximating a target curve with a B-spline curve based on square distance minimization, or SDM. The main advantage o...
Huaiping Yang, Wenping Wang, Jia-Guang Sun