173 search results - page 4 / 35 » The Fastest and Shortest Algorithm for All Well-Defined Prob... |
CPM
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
SIAMCOMP
2008
13 years 5 months ago
2008
The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that r...
ALGORITHMICA
2011
13 years 24 days ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...