Sciweavers

3044 search results - page 138 / 609
» Linear logical approximations
Sort
View
MFCS
2005
Springer
14 years 3 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta
DAM
2010
120views more  DAM 2010»
13 years 10 months ago
A new approximation algorithm for the multilevel facility location problem
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
IPL
2008
105views more  IPL 2008»
13 years 10 months ago
Hausdorff approximation of 3D convex polytopes
Let P be a convex polytope in Rd , d = 3 or 2, with n vertices. We present linear time algorithms for approximating P by simpler polytopes. For instance, one such algorithm select...
Mario A. Lopez, Shlomo Reisner
CGI
2000
IEEE
14 years 2 months ago
Fast and Stable Animation of Cloth with an Approximated Implicit Method
Realistic animation of soft objects such as cloth is essential for plausible character animation. Many techniques have been proposed for the simulation of soft objects, and most o...
Young-Min Kang, Jeong-Hyeon Choi, Hwan-Gue Cho, Ch...
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 11 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu