Sciweavers

425 search results - page 43 / 85
» Polynomial Factorization 1987-1991
Sort
View
APPROX
2009
Springer
149views Algorithms» more  APPROX 2009»
14 years 5 months ago
On the Complexity of the Asymmetric VPN Problem
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
Thomas Rothvoß, Laura Sanità
INFOCOM
2007
IEEE
14 years 5 months ago
Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
Changhee Joo, Ness B. Shroff
ICDT
2005
ACM
149views Database» more  ICDT 2005»
14 years 4 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
EUROCRYPT
2006
Springer
14 years 2 months ago
VSH, an Efficient and Provable Collision-Resistant Hash Function
Abstract. We introduce VSH, very smooth hash, a new S-bit hash function that is provably collision-resistant assuming the hardness of finding nontrivial modular square roots of ver...
Scott Contini, Arjen K. Lenstra, Ron Steinfeld
IPCO
2008
91views Optimization» more  IPCO 2008»
14 years 10 days ago
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....