CORR
2012
Springer
12 years 23 days ago
2012
Springer
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...
AAAI
2011
12 years 5 months ago
2011
We describe the Fourier Basis, a linear value function approximation scheme based on the Fourier Series. We empirically evaluate its properties, and demonstrate that it performs w...
WAOA
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
SIAMDM
2000
13 years 4 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
MOR
2000
13 years 4 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
CAGD
2008
13 years 5 months ago
2008
The minimum-supported bivariate C2-cubic spline on a 6-directional mesh constructed in our previous work [2] can be used to extend Loop's approximation subdivision scheme to ...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
ESA
2007
Springer
13 years 9 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
STOC
1998
ACM
13 years 9 months ago
1998
ACM
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...