7129 search results - page 196 / 1426 » Approximation Algorithms for Treewidth |
151
click to vote
COLOGNETWENTE
2010
15 years 2 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
112
Voted
WG
2001
Springer
15 years 8 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
144
click to vote
SODA
1998
ACM
15 years 5 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
147
click to vote
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
109
click to vote
SIGMOD
1998
ACM
15 years 8 months ago
1998
ACM
We present new algorithms for computing approximate quantiles of large datasets in a single pass. The approximation guarantees are explicit, and apply without regard to the value ...