Sciweavers

841 search results - page 85 / 169
» Approximability of Minimum AND-Circuits
Sort
View
PG
2007
IEEE
14 years 4 months ago
Developable Strip Approximation of Parametric Surfaces with Global Error Bounds
Developable surfaces have many desired properties in manufacturing process. Since most existing CAD systems utilize parametric surfaces as the design primitive, there is a great d...
Yong-Jin Liu, Yu-Kun Lai, Shi-Min Hu
FOCS
2008
IEEE
14 years 4 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
ICALP
2005
Springer
14 years 3 months ago
Approximation Algorithms for Euclidean Group TSP
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H....
WWW
2008
ACM
14 years 11 months ago
An Effective Aggregation Policy for RSS Services
RSS is the XML-based format for syndication of Web contents and users aggregate RSS feeds with RSS feed aggregators. As the usage of RSS service has been diffused, it is crucial to...
Jae Hwi Kim, Sang Ho Lee, Young Geun Han
AAIM
2009
Springer
137views Algorithms» more  AAIM 2009»
14 years 4 months ago
On Approximating an Implicit Cover Problem in Biology
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Ar...