7930 search results - page 287 / 1586 » Greedy in Approximation Algorithms |
181
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
197
click to vote
COLOGNETWENTE
2010
15 years 5 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...
155
Voted
WG
2001
Springer
15 years 11 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...
201
click to vote
SODA
1998
ACM
15 years 8 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...
190
click to vote
CDC
2008
IEEE
16 years 1 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...