AAIM
2006
Springer
13 years 8 months ago
2006
Springer
We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated al...
AAIM
2006
Springer
13 years 8 months ago
2006
Springer
Due to the increasing security threats on the Internet, new overlay network architectures have been proposed to secure privileged services. In these architectures, the application...
AAIM
2006
Springer
13 years 10 months ago
2006
Springer
We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. T...
AAIM
2006
Springer
13 years 10 months ago
2006
Springer
AAIM
2006
Springer
13 years 10 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
13 years 10 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
13 years 10 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
13 years 10 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
13 years 10 months ago
2006
Springer
AAIM
2006
Springer
13 years 10 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...