The Problem of Placement of Visual Landmarks

Gorbenko, Anna; Mornev, Maxim; Popov, Vladimir

doi:10.15514/syrcose-2011-5-22

Cited by 15 publications

(15 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have consider our genetic algorithms OA [1] (see [24]), OA [2] (see [25]), OA [3] (see [26]), and OA [4] (see [27]) for SAT. We have used heterogeneous cluster.…”

Section: Theorem 2 Str-ic-lcps Is Np-complete Proof It Is Clear Thmentioning

confidence: 99%

Longest common parameterized subsequences with fixed common substring

Gorbenko¹,

Popov²

2013

ams

View full text Add to dashboard Cite

show abstract

“…We have consider our genetic algorithms OA [1] (see [24]), OA [2] (see [25]), OA [3] (see [26]), and OA [4] (see [27]) for SAT. We have used heterogeneous cluster.…”

Section: Theorem 2 Str-ic-lcps Is Np-complete Proof It Is Clear Thmentioning

confidence: 99%

Longest common parameterized subsequences with fixed common substring

Gorbenko¹,

Popov²

2013

ams

View full text Add to dashboard Cite

show abstract

“…We consider our genetic algorithms OA [1] (see [20]), OA [2] (see [21]), OA [3] [22]), and OA [4] (see [23]) for SAT. We used heterogeneous cluster.…”

Section: It Is Easy To Check That There Are a Set S ⊆ N And Function mentioning

confidence: 99%

The problem of selection of a set of partially distinguishable guards

Gorbenko¹,

Popov²

2013

ams

View full text Add to dashboard Cite

show abstract

“…We consider our genetic algorithms OA [1] (see [22]), OA [2] (see [23]), OA [3] (see [24]), and OA [4] (see [25]) for SAT. We used heterogeneous cluster.…”

Section: It Is Easy To Check That There Is a String S Such That |S| =mentioning

confidence: 99%

Restricted common superstrings

Gorbenko¹,

Popov²

2013

ams

Self Cite

View full text Add to dashboard Cite

In this paper we consider an approach to solve the restricted common superstring problem. This approach is based on an explicit reduction from the problem to the satisfiability problem.Keywords: restricted common superstring, NP-complete, satisfiabilityComputational complexity of different problems of finding regularities and efficient algorithms for these problems are thoroughly studied in theoretical computer science (see e.g. [1] -[6]). In particular, complexity of the restricted common superstring problem and some approximation algorithms for the problem was considered in [7,8].Let Σ = {a 1 , . . . , a m } be a finite alphabet. Let S = {S 1 , . . . , S n } be a set of strings over Σ. We assume that S[i] is the ith letter in string S. Also, we assume that S [i, j] is the substring of S consisting of the ith letter through the jth letter. The length of a string S is the number of letters in it. We assume that |S| is the length of S. We use #occ(X, Y ) to denote |{i | X = Y [i, j]}|.

show abstract

The Problem of Placement of Visual Landmarks

Cited by 15 publications

References 28 publications

Longest common parameterized subsequences with fixed common substring

Longest common parameterized subsequences with fixed common substring

The problem of selection of a set of partially distinguishable guards

Restricted common superstrings

Contact Info

Product

Resources

About