AAIM
2006
Springer
14 years 5 months ago
2006
Springer
AAIM
2006
Springer
14 years 5 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
AAIM
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. We derive a polynomial time algorithm to compute a stable solution in a mixed matching market from an auction procedure as presented by Eriksson and Karlander [5]. As a s...
AAIM
2006
Springer
14 years 5 months ago
2006
Springer
In this note we deal with sensitivity analysis of combinatorial optimization problems and its fundamental term, the tolerance. For three classes of objective functions (Σ, Π, MA...
AAIM
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
AAIM
2006
Springer
14 years 5 months ago
2006
Springer
AAIM
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. We study an extension of the set cover problem, the connected set cover problem, the problem is to find a set cover of minimal size that satisfies some connectivity con...
AAIM
2006
Springer
14 years 5 months ago
2006
Springer
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
AAIM
2006
Springer
14 years 5 months ago
2006
Springer
AAECC
2006
Springer
14 years 5 months ago
2006
Springer
The Fujisaki-Okamoto (FO) conversion is widely known to be able to generically convert a weak public key encryption scheme, say one-way against chosen plaintext attacks (OW-CPA), t...