Sciweavers

Share
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
9 years 6 months ago
Linear Programming Polytope and Algorithm for Mean Payoff Games
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...
Ola Svensson, Sergei G. Vorobyov
AAIM
2006
Springer
129views Algorithms» more  AAIM 2006»
9 years 6 months ago
Secure Overlay Network Design
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...
Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni
AAIM
2006
Springer
143views Algorithms» more  AAIM 2006»
9 years 8 months ago
A Compression-Boosting Transform for Two-Dimensional Data
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...
Qiaofeng Yang, Stefano Lonardi, Avraham Melkman
AAIM
2006
Springer
75views Algorithms» more  AAIM 2006»
9 years 8 months ago
Subsequence Packing: Complexity, Approximation, and Application
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 ...
Minghui Jiang
AAIM
2006
Springer
97views Algorithms» more  AAIM 2006»
9 years 8 months ago
Note on an Auction Procedure for a Matching Game in Polynomial Time
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...
Winfried Hochstättler, Hui Jin 0002, Robert N...
AAIM
2006
Springer
94views Algorithms» more  AAIM 2006»
9 years 8 months ago
Some Basics on Tolerances
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...
Boris Goldengorin, Gerold Jäger, Paul Molitor
AAIM
2006
Springer
110views Algorithms» more  AAIM 2006»
9 years 8 months ago
Non-metric Multicommodity and Multilevel Facility Location
Abstract. We give logarithmic approximation algorithms for the nonmetric uncapacitated multicommodity and multilevel facility location problems. The former algorithms are optimal u...
Rudolf Fleischer, Jian Li, Shijun Tian, Hong Zhu
AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
9 years 8 months ago
Connected Set Cover Problem and Its Applications
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...
Tianping Shuai, Xiao-Dong Hu
books