2069 search results - page 12 / 414 » Linear time algorithms for Clobber |
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
SPIRE
2009
Springer
15 years 4 months ago
2009
Springer
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
JCO
2000
14 years 9 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
108
click to vote
WADS
2007
Springer
15 years 3 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
102
click to vote
GLOBECOM
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— We propose low-complexity equalizers for Alamouti space-time coded orthogonal frequency-division multiplexing (OFDM) systems in time- and frequency-selective channels, ...