7129 search results - page 302 / 1426 » Approximation Algorithms for Treewidth |
107
click to vote
JDA
2006
15 years 4 months ago
2006
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
117
Voted
MOC
2002
15 years 4 months ago
2002
The authors study the Hilbert Transform on the real line. They introduce some polynomial approximations and some algorithms for its numerical evaluation. Error estimates in uniform...
121
Voted
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
We provide a novel view of learning an approximate model of a partially observable environment from data and present a simple implemenf the idea. The learned model abstracts away ...
124
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
116
click to vote
DAM
2006
15 years 4 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...