7129 search results - page 71 / 1426 » Approximation Algorithms for Treewidth |
130
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
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) -...
108
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
123
Voted
CCCG
2010
15 years 4 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
149
Voted
ALGORITHMICA
1998
15 years 2 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
156
Voted
CSDA
2011
14 years 9 months ago
2011
Motivated by the application of seismic inversion in the petroleum industry we consider a hidden Markov model with two hidden layers. The bottom layer is a Markov chain and given ...