Sciweavers

3875 search results - page 43 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
53
Voted
ORL
2008
82views more  ORL 2008»
14 years 9 months ago
An approximation algorithm for the wireless gathering problem
Vincenzo Bonifaci, Peter Korteweg, Alberto Marchet...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 3 days ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
91
Voted
IJFCS
2002
58views more  IJFCS 2002»
14 years 9 months ago
Vector Algorithms for Approximate String Matching
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
Anne Bergeron, Sylvie Hamel
ICC
2009
IEEE
140views Communications» more  ICC 2009»
14 years 7 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...