105 search results - page 13 / 21 » Improved approximation algorithms for minimum-weight vertex ... |
141
Voted
CAD
2005
Springer
15 years 3 months ago
2005
Springer
Subdivision surfaces are generated by repeated approximation or interpolation from initial control meshes. In this paper, two new nonlinear subdivision schemes, face based subdivi...
162
Voted
WADS
2007
Springer
15 years 10 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
154
Voted
FOCS
1995
IEEE
15 years 7 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
139
Voted
CAD
2008
Springer
15 years 3 months ago
2008
Springer
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
133
Voted
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...