Sciweavers

3475 search results - page 81 / 695
» Backbones in Optimization and Approximation
Sort
View
ICDCS
2007
IEEE
15 years 8 months ago
Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves
We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduce...
Zhenhui Shen, Srikanta Tirthapura
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
15 years 8 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
Matthias Müller-Hannemann, Siamak Tazari
146
Voted
AAECC
2007
Springer
117views Algorithms» more  AAECC 2007»
15 years 2 months ago
A predictor-corrector-type technique for the approximate parameterization of intersection curves
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
Bert Jüttler, Pavel Chalmovianský
130
Voted
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 2 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier
126
Voted
IPL
2002
118views more  IPL 2002»
15 years 2 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...