28 search results - page 2 / 6 » cocoon 2006 |
INFORMATICASI
2006
14 years 9 months ago
2006
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We examine how to induce selfish heterogeneous users in a multicommodity network to reach an equilibrium that minimizes the social cost. In the absence of centralized coordination...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a ...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We present a simple O(m+n6 / 12 ) time (1+ )-approximation algorithm for the problem of cutting a convex n-gon out of a convex m-gon with line cuts of minimum total cutting length....