Sciweavers

3818 search results - page 151 / 764
» Word Problems on Compressed Words
Sort
View
128
Voted
IPL
2008
114views more  IPL 2008»
15 years 5 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
SIAMCO
2008
121views more  SIAMCO 2008»
15 years 5 months ago
A Direct Solution Method for Stochastic Impulse Control Problems of One-dimensional Diffusions
We consider stochastic impulse control problems where the process is driven by one-dimensional diffusions. Impulse control problems are widely applied to financial engineering and...
Masahiko Egami
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
15 years 4 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
IPL
1998
119views more  IPL 1998»
15 years 4 months ago
A 2.5-Factor Approximation Algorithm for the k-MST Problem
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
Sunil Arya, H. Ramesh
TCS
2002
15 years 4 months ago
Binary (generalized) Post Correspondence Problem
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
Vesa Halava, Tero Harju, Mika Hirvensalo