7129 search results - page 308 / 1426 » Approximation Algorithms for Treewidth |
120
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
120
click to vote
IPL
2007
15 years 4 months ago
2007
We observe that combining the techniques of Arora, Rao, and Vazirani, with the rounding algorithm of Rao and Richa yields an O( √ log n log log n)-approximation for the minimum-...
202
Voted
CAD
1998
Springer
15 years 4 months ago
1998
Springer
Developable surfaces are modelled with pieces of right circular cones. These cone spline surfaces are well-suited for applications: They possess degree two parametric and implicit...
231
Voted
ICDE
1996
IEEE
16 years 6 months ago
1996
IEEE
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
153
click to vote
JSCIC
2008
15 years 4 months ago
2008
Solutions of the master equation are approximated using a hierarchy of models based on the solution of ordinary differential equations: the macroscopic equations, the linear noise...