Sciweavers

COCO
2005
Springer
131views Algorithms» more  COCO 2005»
14 years 2 months ago
On the Hardness of Approximating Multicut and Sparsest-Cut
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuv...
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 2 months ago
Derandomized Squaring of Graphs
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squar...
Eyal Rozenman, Salil P. Vadhan
MOBICOM
2006
ACM
14 years 3 months ago
Broadcast capacity in multihop wireless networks
In this paper we study the broadcast capacity of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such th...
Alireza Keshavarz-Haddad, Vinay J. Ribeiro, Rudolf...
WADS
2007
Springer
155views Algorithms» more  WADS 2007»
14 years 3 months ago
Constant Factor Approximations for the Hotlink Assignment Problem
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Tobias Jacobs
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 3 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel
LATIN
2010
Springer
14 years 3 months ago
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication
We consider the multiplication of a sparse N × N matrix A with a dense N × N matrix B in the I/O model. We determine the worst-case non-uniform complexity of this task up to a c...
Gero Greiner, Riko Jacob
CSR
2009
Springer
14 years 3 months ago
A Feebly Secure Trapdoor Function
Abstract. In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are pro...
Edward A. Hirsch, Sergey I. Nikolenko
WWW
2010
ACM
14 years 4 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
WWW
2007
ACM
14 years 10 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui