Sciweavers

AAIM
2006
Springer
222views Algorithms» more  AAIM 2006»
15 years 3 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
80
Voted
AAIM
2006
Springer
143views Algorithms» more  AAIM 2006»
15 years 3 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
55
Voted
AAIM
2006
Springer
134views Algorithms» more  AAIM 2006»
15 years 3 months ago
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
Emgad H. Bachoore, Hans L. Bodlaender
AAIM
2006
Springer
129views Algorithms» more  AAIM 2006»
15 years 22 days 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
54
Voted
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
15 years 3 months ago
Atomic Routing Games on Maximum Congestion
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...
Costas Busch, Malik Magdon-Ismail
Algorithms
Top of PageReset Settings