APPROX
2005
Springer
14 years 11 months ago
2005
Springer
APPROX
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
ACIVS
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. In this paper we present a new implementation of a rainfalling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to c...
AAIM
2005
Springer
14 years 11 months ago
2005
Springer
AAIM
2005
Springer
14 years 11 months ago
2005
Springer
In this paper we study the set cover games when the elements are selfish agents. In this case, each element has a privately known valuation of receiving the service from the sets,...
AAIM
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. The utilization of pseudo-random proportional rule to balance between the exploitation and exploration of the search process was shown in Ant Colony System (ACS) algorith...
AAIM
2005
Springer
14 years 11 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
AAIM
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of f...
STOC
2005
ACM
14 years 11 months ago
2005
ACM
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
STOC
2005
ACM
14 years 11 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...